On finding and updating shortest paths distributively
Journal of Algorithms
Local management of a global resource in a communication network
Journal of the ACM (JACM)
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
SIAM Journal on Computing
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Leader election algorithms for mobile ad hoc networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Distributed Algorithms
Distributed Algorithms for Updating Shortest Paths (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Maintaining information in fully dynamic trees with top trees
ACM Transactions on Algorithms (TALG)
Point-of-Failure Shortest-Path Rerouting: Computing the Optimal Swap Edges Distributively
IEICE - Transactions on Information and Systems
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Applying static network protocols to dynamic networks
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
Improved compact routing schemes for dynamic trees
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Efficient distributed approximation algorithms via probabilistic tree embeddings
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Proceedings of the 28th ACM symposium on Principles of distributed computing
Partially dynamic efficient algorithms for distributed shortest paths
Theoretical Computer Science
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum-Diameter Spanning Tree
IEEE Transactions on Dependable and Secure Computing
On Dynamic Shortest Paths Problems
Algorithmica
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Controller and estimator for dynamic networks
Information and Computation
| Hi-index | 0.00 |
We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We show (1+ε)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network. This breaks the Θ(D) time bound of recomputing "from scratch". Our technique also leads to a (1+ε)-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of [9] that is optimal under some assumptions [27]. Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if a small approximation is allowed.