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

We present improved combinatorial approximation algorithms for the uncapacitated facility
location and k-median problems. Two central ideas in most of our results are cost scaling …

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 …

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 …

Given an alphabet Σ, a (directed) graph G whose edges are weighted and Σ-labeled, and a
formal language L⊆Σ^*, the formal-language-constrained shortest/simple path problem …

We present improved combinatorial approximation algorithms for the uncapacitated facility
location problem. Two central ideas in most of our results are cost scaling and greedy …

Preface Due to the development of hardware technologies (such as VLSI) in the early
1980s, the interest in parallel and distributive computing has been rapidly growingandinthelate1980sthestudyofparall …

Given an undirected graph with two different nonnegative costs associated with every edge
e (say, we for the weight and le for the length of edge e) and a budget L, consider the …

We present an heuristic genetic algorithm for the quality of service (QoS) multicast routing
that depends on:(1) bounded end-to-end delay and link bandwidth along the paths from the …

This paper deals with the design of efficiently computable incentive compatible, or truthful,
mechanisms for combinatorial optimization problems with multi-parameter agents. We focus …