266 search results - page 54 / 54 » Graphs with Bounded Induced Distance |
JDA
2007
13 years 5 months ago
2007
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 starti...