103 search results - page 4 / 21 » Computing approximate shortest paths on convex polytopes |
100
click to vote
ISVD
2007
IEEE
15 years 5 months 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
15 years 5 months ago
2005
Springer
101
click to vote
INFOCOM
2006
IEEE
15 years 5 months 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
14 years 11 months ago
2004
ACM
87
Voted
JAL
2007
14 years 11 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...