{"status":"public","day":"01","type":"journal_article","citation":{"short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, ACM Transactions on Algorithms 13 (2017).","apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2017). Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3146550\">https://doi.org/10.1145/3146550</a>","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” <i>ACM Transactions on Algorithms</i>, vol. 13, no. 4. Association for Computing Machinery, 2017.","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” <i>ACM Transactions on Algorithms</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3146550\">https://doi.org/10.1145/3146550</a>.","ista":"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.","mla":"Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks.” <i>ACM Transactions on Algorithms</i>, vol. 13, no. 4, 51, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3146550\">10.1145/3146550</a>.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks. <i>ACM Transactions on Algorithms</i>. 2017;13(4). doi:<a href=\"https://doi.org/10.1145/3146550\">10.1145/3146550</a>"},"year":"2017","publisher":"Association for Computing Machinery","doi":"10.1145/3146550","oa_version":"Preprint","scopus_import":"1","title":"Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks","intvolume":"        13","oa":1,"month":"10","publication":"ACM Transactions on Algorithms","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1512.08147"}],"date_created":"2022-07-27T11:37:23Z","extern":"1","date_updated":"2022-09-09T11:57:42Z","publication_identifier":{"eissn":["1549-6333"],"issn":["1549-6325"]},"article_number":"51","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":13,"_id":"11665","publication_status":"published","issue":"4","article_processing_charge":"No","language":[{"iso":"eng"}],"article_type":"original","abstract":[{"lang":"eng","text":"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.\r\n\r\nOur 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."}],"acknowledgement":"We thank the reviewers of ICALP 2013 for pointing to related articles and to an error in an example\r\ngiven in a previous version of this article. We also thank one of the reviewers of Transactions on\r\nAlgorithms for very detailed comments.","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger"},{"full_name":"Krinninger, Sebastian","first_name":"Sebastian","last_name":"Krinninger"},{"last_name":"Nanongkai","full_name":"Nanongkai, Danupon","first_name":"Danupon"}],"external_id":{"arxiv":["1512.08147"]},"date_published":"2017-10-01T00:00:00Z"}