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

The Minimum Latency Problem (MLP) is a variant of the Traveling Salesman Problem which
aims to minimize the sum of arrival times at vertices. The problem arises in a number of …

We give improved approximation algorithms for a variety of latency minimization problems.
In particular, we give a 3.59-approximation to the minimum latency problem, improving on …

The Traveling Deliveryman Problem is a generalization of the Minimum Cost Hamiltonian
Path Problem where the starting vertex of the path, ie a depot vertex, is fixed in advance and …

In the minimum latency problem (MLP) we are given n points v 1,..., vn and a distance d (vi,
vj) between any pair of points. We have to find a tour, starting at v 1 and visiting all points, for …

In this paper, we study ak-Travelling Repairmen Problem where the objective is to minimize
the sum of clients waiting time to receive service. This problem is relevant in applications …

We present a new approximation algorithm for the (metric) prize-collecting traveling
salesperson problem (PCTSP). In PCTSP, opposed to the classical traveling salesperson …

Prize-Collecting TSP is a variant of the traveling salesperson problem where one may drop
vertices from the tour at the cost of vertex-dependent penalties. The quality of a solution is …

We present a novel approach to mobile robot search for non-stationary objects in partially
known environments. We formulate the search as a path planning problem in an …

In network problems, latency is associated with the metric used to evaluate the length of the
path from a root vertex to each vertex in the network. In this work we are dealing with two …