473 search results - page 7 / 95 » Computing shortest paths with uncertainty |
TON
2002
14 years 9 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
ITIIS
2010
14 years 4 months ago
2010
ATMOS
2010
14 years 8 months ago
2010
SODA
2010
ACM
15 years 7 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
SIAMCOMP
2010
14 years 4 months ago
2010
We describe algorithms to compute the shortest path homotopic to a given path, or the shortest cycle freely homotopic to a given cycle, on an orientable combinatorial surface. Unli...