STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
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
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the k-traveling repairman problem with repairtimes
Journal of Discrete Algorithms
ACM Transactions on Algorithms (TALG)
Sequential auctions for heterogeneous task allocation in multiagent routing domains
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Online k-server routing problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Operations Research Letters
Physical search problems with probabilistic knowledge
Artificial Intelligence
| Hi-index | 0.00 |
We consider the k-traveling repairman problem, a generalization of the metric traveling repairman problem, also known as the minimum latency problem, to multiple repairmen. We give an 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 (i-MST) problem. This can be compared with the best known approximation algorithm for the case k = 1, which is 3.59α. 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 which can be extended to the case of multiple repairmen.