18 search results - page 4 / 4 » The bi-objective covering tour problem |
JDA
2007
13 years 9 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...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
IROS
2007
IEEE
14 years 4 months ago
2007
IEEE
— In this paper we address the joint problems of automated data acquisition and view planning for large–scale indoor and outdoor sites. Our method proceeds in two distinct stag...