Polynomial time approximation schemes for the traveling repairman and other minimum latency problems.
Work
Year: 2013
Type: preprint
Abstract: We give a polynomial time, (1 + ∊)-approximation algorithm for the traveling repairman problem (TRP) in the Euclidean plane, on weighted planar graphs, and on weighted trees. This improves on the know... more
Author René Sitters
Institution Vrije Universiteit Amsterdam
Cites: 30
Cited by: 11
Related to: 10
Citation percentile (by year/subfield): 88.14
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green