This chapter surveys approximation algorithms for hard geometric problems. The problems
we consider typically take inputs that are point sets or polytopes in two-or three-dimensional …

Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …

Distributed computing concerns environments in which many processors, located at different
sites, must operate in a noninterfering and cooperative manner. Each of the processors …

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

10.1▪ Introduction The key characteristic of the class of Vehicle Routing Problems with Profits
(VRPPs) is that, contrary to what happens for the most classical vehicle routing problems …

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 …

A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

This survey covers topics in geometric network design theory. The problem is easy to state:
connect a collection of n sites by a “good” network. For instance, one may wish to connect …

Due to the fact that no NP-complete problem can be solved in polynomial time (unless P=
NP), many approximability results (both positive and negative) of NP-hard optimization …

The aim of Cooperative Games on Combinatorial Structures is to analyze conflict situations
in which two or more players can make coalitions and obtain prizes and penalties. This …