410 search results - page 10 / 82 » Upgrading Shortest Paths in Networks |
SIGMOD
2008
ACM
14 years 11 months ago
2008
ACM
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
ASIAMS
2007
IEEE
15 years 6 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
SIROCCO
2003
15 years 1 months ago
2003
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
NETWORKS
2010
14 years 10 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
DSN
2003
IEEE
15 years 5 months ago
2003
IEEE
—We formulate a notion of local stabilization, by which a system self-stabilizes in time proportional to the size of any perturbation that changes the network topology or the sta...