Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks
Henzinger MH, Krinninger S, Nanongkai D. 2017. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 13(4), 51.
Download (ext.)
https://arxiv.org/abs/1512.08147
[Preprint]
DOI
Journal Article
| Published
| English
Scopus indexed
Author
Henzinger, MonikaISTA ;
Krinninger, Sebastian;
Nanongkai, Danupon
Abstract
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 present deterministic (1+ϵ)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network.
Our technique also leads to a deterministic (1+ϵ)-approximate incremental algorithm for single-source shortest paths in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of Even and Shiloach (1981), which is optimal under some assumptions (Roditty and Zwick 2011; Henzinger et al. 2015). Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if some approximation is allowed.
Publishing Year
Date Published
2017-10-01
Journal Title
ACM Transactions on Algorithms
Publisher
Association for Computing Machinery
Acknowledgement
We thank the reviewers of ICALP 2013 for pointing to related articles and to an error in an example
given in a previous version of this article. We also thank one of the reviewers of Transactions on
Algorithms for very detailed comments.
Volume
13
Issue
4
Article Number
51
ISSN
eISSN
IST-REx-ID
Cite this
Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 2017;13(4). doi:10.1145/3146550
Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2017). Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3146550
Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” ACM Transactions on Algorithms. Association for Computing Machinery, 2017. https://doi.org/10.1145/3146550.
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” ACM Transactions on Algorithms, vol. 13, no. 4. Association for Computing Machinery, 2017.
Henzinger MH, Krinninger S, Nanongkai D. 2017. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. ACM Transactions on Algorithms. 13(4), 51.
Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” ACM Transactions on Algorithms, vol. 13, no. 4, 51, Association for Computing Machinery, 2017, doi:10.1145/3146550.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Export
Marked PublicationsOpen Data ISTA Research Explorer
Sources
arXiv 1512.08147