We study the problem of online team formation. We consider a setting in which people
possess different skills and compatibility among potential team members is modeled by a …

We study problems in multiobjective optimization, in which solutions to a combinatorial
optimization problem are evaluated with respect to several cost criteria, and we are …

We give the first approximation algorithm for the node-weighted Steiner tree problem. Its
performance guarantee is within a constant factor of the best possible unless P̃⊇ NP.(P̃ …

Network Design is an active research area in the intersection of Combinatorial Optimization
and Theoretical Computer Science that focuses on problems arising in the realm of modern …

In recent years, a gradual increase in the sophistication of multiobjective evolutionary
algorithms (MOEAs) for Pareto optimization has been seen, accompanied by an ever …

Given an undirected graph representing a network of processors, and a source node
containing a message that must be broadcast to all the nodes, find a scheme that …

Rideshare platforms, when assigning requests to drivers, tend to maximize profit for the
system and/or minimize waiting time for riders. Such platforms can exacerbate biases that …

In the Minimum Bounded Degree Spanning Tree problem, we are given an undirected
graph G=(V, E) with a degree upper bound Bv on each vertex v∈ V, and the task is to find a …

We study the problem of finding small trees. Classical network design problems are
considered with the additional constraint that only a specified number k of nodes are …

We study a general class of bicriteria network design problems. A generic problem in this
class is as follows: Given an undirected graph and two minimization objectives (under …