7 search results - page 2 / 2 » A Fully Dynamic Approximation Scheme for Shortest Paths in P... |
SIROCCO
2001
13 years 6 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
MOBIHOC
2005
ACM
14 years 5 months ago
2005
ACM
Location information is very useful in the design of sensor network infrastructures. In this paper, we study the anchor-free 2D localization problem by using local angle measureme...