103 search results - page 4 / 21 » Computing approximate shortest paths on convex polytopes |
ISVD
2007
IEEE
14 years 15 days ago
2007
IEEE
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
STACS
2005
Springer
13 years 11 months ago
2005
Springer
INFOCOM
2006
IEEE
14 years 8 days ago
2006
IEEE
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
COMGEO
2004
ACM
13 years 6 months ago
2004
ACM
JAL
2007
13 years 6 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...