Traveling salesman problems with profits (TSPs with profits) are a generalization of the
traveling salesman problem (TSP), where it is not necessary to visit all vertices. A profit is …

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 …

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

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 …

The primal-dual method is a standard tool in the design of algorithms for combinatorial
optimization problems. This chapter shows how the primal-dual method can be modi ed to …

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 …

Consider a salesperson that must sell some quota of brushes in order to win a trip to Hawaii.
This salesperson has a map (a weighted graph) in which each city has an attached demand …

In this article, we consider the orienteering problem in undirected and directed graphs and
obtain improved approximation algorithms. The point to point-orienteering problem is the …