Sciweavers

763 search results - page 8 / 153
» Engineering Shortest Path Algorithms
Sort
View
CORR
2008
Springer
133views Education» more  CORR 2008»
13 years 7 months ago
Approximation Algorithms for Shortest Descending Paths in Terrains
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, Sandip Das, Sachin Lodha, Anna Lubiw...
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...
DAM
2000
199views more  DAM 2000»
13 years 7 months ago
Approximation algorithms for the shortest total path length spanning tree problem
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
CCCG
2003
13 years 9 months ago
On shortest paths in line arrangements
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
Telikepalli Kavitha, Kasturi R. Varadarajan
COCOON
1999
Springer
13 years 12 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...