Sciweavers

28 search results - page 1 / 6
» Partially Dynamic Algorithms for Distributed Shortest Paths ...
Sort
View
JCP
2007
111views more  JCP 2007»
13 years 3 months ago
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele ...
ICCTA
2007
IEEE
13 years 10 months ago
Partially Dynamic Concurrent Update of Distributed Shortest Paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele ...
LCN
1999
IEEE
13 years 8 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
PVLDB
2010
146views more  PVLDB 2010»
13 years 2 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
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...
Michael Rice, Vassilis J. Tsotras
NETWORKS
2008
13 years 3 months ago
New dynamic programming algorithms for the resource constrained elementary shortest path problem
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
Giovanni Righini, Matteo Salani