Searching for "The k-traveling repairman problem." – sorted by Relevance.
-
The k-Traveling Repairman Problem
- The k-Traveling Repairman Problem Jittat Fakcharoenphol # Chris Harrelson + Satish Rao # Abstract
- Cited by 18 (1 self) – Add To MetaCart
-
Online k-server routing problems
- the average completion time (k-Traveling Repairman Problem). We give competitive algorithms, resource
- Cited by 2 (1 self) – Add To MetaCart
-
Approximation algorithms for minimizing average distortion
- . The problem of finding Minimum Latency tours (a.k.a. the Traveling Repairman problem) is relevant to our
- Cited by 1 (1 self) – Add To MetaCart
-
Paths, trees and minimum latency tours
- and Kleinberg [21]. Since algorithms for various related problems such as k-traveling repairman [14, 12
- Cited by 3 (0 self) – Add To MetaCart
-
Covering Graphs Using Trees and Stars
- for the k-traveling repairman problem, where the objective is to minimize the average waiting time
- Cited by 2 (0 self) – Add To MetaCart
-
Min-Max tree covers of graphs
- routing” problems (see [8] for a recent survey). In the k-traveling salesperson problem, a feasible
- Cited by 4 (0 self) – Add To MetaCart

