354 search results - page 61 / 71 » Algorithms for the Minimum Edge Cover of H-Subgraphs of a Gr... |
DISOPT
2010
13 years 7 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
FUN
2010
Springer
14 years 6 days ago
2010
Springer
We consider a class of highly dynamic networks modelled on an urban subway system. We examine the problem of creating a map of such a subway in less than ideal conditions, where th...
DAM
1999
13 years 7 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...
IJRR
2002
13 years 7 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
PODC
2005
ACM
14 years 29 days ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...