On the minimum latency problem

Details On the minimum latency problem On the minimum latency problem

1994-09-21

arxiv.org/abs/math/9409223v1

Mathematics

Combinatorics

9 pages

Scientific paper

We are given a set of points $p_1,\ldots , p_n$ and a symmetric distance matrix $(d_{ij})$ giving the distance between $p_i$ and $p_j$. We wish to construct a tour that minimizes $\sum_{i=1}^n \ell(i)$, where $\ell(i)$ is the {\em latency} of $p_i$, defined to be the distance traveled before first visiting $p_i$. This problem is also known in the literature as the {\em deliveryman problem} or the {\em traveling repairman problem}. It arises in a number of applications including disk-head scheduling, and turns out to be surprisingly different from the traveling salesman problem in character. We give exact and approximate solutions to a number of cases, including a constant-factor approximation algorithm whenever the distance matrix satisfies the triangle inequality.

Affiliated with

Also associated with

No associations

Rating

On the minimum latency problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the minimum latency problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the minimum latency problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-635594