Cited By
View all- Duan RPettie STeng S(2008)Bounded-leg distance and reachability oraclesProceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/1347082.1347130(436-445)Online publication date: 20-Jan-2008
Let V be a set of points in a d-dimensional lp-metric space. Let s,tźV and let L be a real number. An L-bounded leg path from s to t is an ordered set of points which connects s to t such that the leg between any two consecutive points in the set has ...
Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
We address the problem of finding a polynomial-time approximation scheme for shortest bounded-curvature paths in the presence of obstacles. Given an arbitrary environment $\mathcal{E}$ consisting of polygonal obstacles, two feasible configurations, a length ...
Society for Industrial and Applied Mathematics
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in