The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …

Network design problems (NDP) consist of identifying an optimal subgraph of a graph,
subject to side constraints. In generalized NDP, the vertex set is partitioned into clusters and …

On-demand systems in which passengers with similar routes can share a vehicle are
expected to become a relevant part of future mobility, thanks to their flexibility and their …

Randomized algorithms have become a central part of the algorithms curriculum based on
their increasingly widespread use in modern applications. This book presents a coherent …

Given a task T, a pool of individuals X with different skills, and a social network G that
captures the compatibility among these individuals, we study the problem of finding X, a …

The clustered generalized traveling salesman problem (CGTSP) is an extension of the
classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of …

In this paper, we show that any n point metric space can be embedded into a distribution
over dominating tree metrics such that the expected stretch of any edge is O (log n). This …

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 …

The primal–dual method is a powerful algorithmic technique that has proved to be extremely
useful for a wide variety of problems in the area of approximation algorithms for NP-hard …