7 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.DM2008
Shortest Paths Avoiding Forbidden Subpaths
Mustaq Ahmed, Anna Lubiw
In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s…
cs.CG2008★ 1 cited
Approximation Algorithms for Shortest Descending Paths in Terrains
Mustaq Ahmed, Sandip Das, Sachin Lodha +3
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 f…
cs.CG2007★ 7 cited
An Approximation Algorithm for Shortest Descending Paths
Mustaq Ahmed, Anna Lubiw
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 f…