552 search results - page 13 / 111 » Constrained Shortest Path Computation |
119
click to vote
COMPGEOM
1998
ACM
15 years 4 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...
89
Voted
MST
2010
14 years 11 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...
118
Voted
ICC
2011
IEEE
14 years 1 days 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...
90
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
63
Voted
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
