Approximating the k-traveling repairman problem with repairtimes

  title={Approximating the k-traveling repairman problem with repairtimes},
  author={Raja Jothi and Balaji Raghavachari},
  journal={J. Discrete Algorithms},
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starting at s and together covering all the vertices (customers) such that the sum of the latencies experienced by the customers is minimum. Latency of a customer p is defined to be the distance traveled (time elapsed) before visiting p for the first time. Previous literature on the KTR problem has considered the version of… CONTINUE READING


Publications citing this paper.
Showing 1-10 of 18 extracted citations


Publications referenced by this paper.
Showing 1-10 of 12 references

P-Complete Approximation Problems

View 7 Excerpts
Highly Influenced


K. Chaudhuri, B. Godfrey, S. Rao, K. Talwar
tours, and minimum latency tours, in: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS) • 2003
View 3 Excerpts
Highly Influenced

Extremal results and algorithms for degree sequences of graphs

T. Will
Ph.D. Thesis, Univ. of Illinois at Urbana-Champaign • 1993
View 1 Excerpt

Similar Papers

Loading similar papers…