Approximating the k-traveling repairman problem with repairtimes

@article{Jothi2007ApproximatingTK,
title={Approximating the k-traveling repairman problem with repairtimes},
author={Raja Jothi and Balaji Raghavachari},
journal={J. Discrete Algorithms},
year={2007},
volume={5},
pages={293-303}
}

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