173 search results - page 15 / 35 » Bounds and Heuristics for the Shortest Capacitated Paths Pro... |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
CORR
1999
Springer
13 years 7 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
COMPGEOM
2010
ACM
14 years 18 days ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...