Sciweavers

108 search results - page 7 / 22
» Constant-Work-Space Algorithm for a Shortest Path in a Simpl...
Sort
View
SIAMCOMP
2010
93views more  SIAMCOMP 2010»
13 years 2 months ago
Tightening Nonsimple Paths and Cycles on Surfaces
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...
Éric Colin de Verdière, Jeff Erickso...
COR
2004
146views more  COR 2004»
13 years 7 months ago
An exact algorithm for the robust shortest path problem with interval data
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
Roberto Montemanni, Luca Maria Gambardella
CCCG
2007
13 years 9 months ago
Optimal Schedules for 2-guard Room Search
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
Stephen Bahun, Anna Lubiw
CORR
2007
Springer
143views Education» more  CORR 2007»
13 years 7 months ago
An Approximation Algorithm for Shortest Descending Paths
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
Mustaq Ahmed, Anna Lubiw
COCOON
2001
Springer
14 years 5 days ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup