552 search results - page 13 / 111 » Constrained Shortest Path Computation |
COMPGEOM
1998
ACM
14 years 1 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
MST
2010
13 years 8 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
ICC
2011
IEEE
12 years 9 months ago
2011
IEEE
— Anypath routing, a new routing paradigm, has been proposed to improve the performance of wireless networks by exploiting the spatial diversity and broadcast nature of the wirel...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
SOFSEM
2007
Springer
14 years 3 months ago
2007
Springer
