410 search results - page 1 / 82 » Upgrading Shortest Paths in Networks |
103
click to vote
CPAIOR
2011
Springer
14 years 1 months ago
2011
Springer
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
183
Voted
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...
PVLDB
2010
14 years 8 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
DC
2002
14 years 9 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
ICDCS
2011
IEEE
13 years 9 months ago
2011
IEEE
—Routing is a critical operation in networks. In the context of data and sensor networks, routing strategies such as shortest-path, multi-path and potential-based (“all-path”...