Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions.
For every fixed c> 1 and given any n nodes in ℛ2, a randomized version of the scheme finds …

We present approximation algorithms for the metric uncapacitated facility location problem
and the metric k-median problem achieving guarantees of 3 and 6 respectively. The …

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

We give the first nontrivial approximation algorithms for the Steiner tree problem and the
generalized Steiner network problem on general directed graphs. These problems have …

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 …

The design of approximation algorithms for spanning tree problems has become an exciting
and important area of theoretical computer science and also plays a significant role in …

Online algorithms with predictions is a popular and elegant framework for bypassing
pessimistic lower bounds in competitive analysis. In this model, online algorithms are …

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 …

In this paper, we give the first constant-factor approximation algorithm for the rooted
Orienteering problem, as well as a new problem that we call the Discounted-Reward …