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 …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

With the advent of approximation algorithms for NP-hard combinatorial optimization
problems, several techniques from exact optimization such as the primal-dual method have …

Algorithms for approximating the nondominated set of multiobjective optimization problems
are reviewed. The approaches are categorized into general methods that are applicable …

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 …

In this paper, we present an algorithm with an approximation factor of 2 for a Generalized,
Multiple Depot, Multiple Travelling Salesman Problem (GMTSP) when the costs are …

Motivated by multi-budgeted optimization and other applications, we consider the problem of
randomly rounding a fractional solution x in the (non-bipartite graph) matching and matroid …

We introduce and investigate the recharging rendezvous problem for a collaborative team of
Unmanned Aerial Vehicles (UAVs) and Unmanned Ground Vehicles (UGVs), in which UAVs …

Abstract Affinely Adjustable Robust Counterparts provide tractable alternatives to (two‐
stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them to …