Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls

@inproceedings{Archer2010ImprovedAA,
  title={Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls},
  author={Aaron Archer and Anna Blasiak},
  booktitle={SODA},
  year={2010}
}
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the clients experience prior to being served, rather than the total latency experienced by the server (as in the TSP). The MLP sometimes goes by other names, such as the traveling repairman problem, or the deliveryman problem. Unlike most combinatorial optimization problems, the MLP is NP-hard even on trees (Sitters, 2001… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Linear Programming in Infinite Dimensional Spaces

  • Edward J. Anderson, Peter Nash
  • 1987
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…