The k-traveling repairmen problem

Authors:
Jittat Fakcharoenphol;Chris Harrelson;Satish Rao
Affiliations:
Kasetsart University;Google;UC Berkeley, Berkeley, CA
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2007

Citing 14
Cited 4

Introduction to algorithms

Introduction to algorithms
The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Covering points in the plane by k-tours: towards a polynomial time approximation scheme for general k

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for minimum latency problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An improved approximation ratio for the minimum latency problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
P-Complete Approximation Problems

Journal of the ACM (JACM)
A 2 + ε approximation algorithm for the k-MST problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The vehicle routing problem

The vehicle routing problem
Algorithms for Capacitated Vehicle Routing

SIAM Journal on Computing
Faster approximation algorithms for the minimum latency problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
The Minimum Latency Problem Is NP-Hard for Weighted Trees

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Building Edge-Failure Resilient Networks

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A 3-approximation for the minimum tree spanning k vertices

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Paths, Trees, and Minimum Latency Tours

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

Approximation algorithms for optimal decision trees and adaptive TSP problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Facility location with client latencies: linear programming based techniques for minimum latency problems

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Minimum latency submodular cover

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Physical search problems with probabilistic knowledge

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the k-traveling repairmen problem, also known as the minimum latency problem, to multiple repairmen. We give a polynomial-time 8.497α-approximation algorithm for this generalization, where α denotes the best achievable approximation factor for the problem of finding the least-cost rooted tree spanning i vertices of a metric. For the latter problem, a (2 + ϵ)-approximation is known. Our results can be compared with the best-known approximation algorithm using similar techniques for the case k = 1, which is 3.59α. Moreover, recent work of Chaudry et al. [2003] shows how to remove the factor of α, thus improving all of these results by that factor. We are aware of no previous work on the approximability of the present problem. In addition, we give a simple proof of the 3.59α-approximation result that can be more easily extended to the case of multiple repairmen, and may be of independent interest.