{"article_processing_charge":"No","date_created":"2022-08-11T11:25:13Z","month":"07","citation":{"apa":"Henzinger, M. H., Krinninger, S., &#38; Nanongkai, D. (2013). Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In <i>40th International Colloquium on Automata, Languages, and Programming</i> (Vol. 7966, pp. 607–619). Riga, Latvia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>","chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” In <i>40th International Colloquium on Automata, Languages, and Programming</i>, 7966:607–619. Springer Nature, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">https://doi.org/10.1007/978-3-642-39212-2_53</a>.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2013. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. 40th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 7966, 607–619.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in <i>40th International Colloquium on Automata, Languages, and Programming</i>, Riga, Latvia, 2013, vol. 7966, pp. 607–619.","ama":"Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In: <i>40th International Colloquium on Automata, Languages, and Programming</i>. Vol 7966. Springer Nature; 2013:607–619. doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>","mla":"Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” <i>40th International Colloquium on Automata, Languages, and Programming</i>, vol. 7966, Springer Nature, 2013, pp. 607–619, doi:<a href=\"https://doi.org/10.1007/978-3-642-39212-2_53\">10.1007/978-3-642-39212-2_53</a>.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 40th International Colloquium on Automata, Languages, and Programming, Springer Nature, 2013, pp. 607–619."},"external_id":{"arxiv":["1512.08147"]},"page":"607–619","status":"public","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","extern":"1","volume":7966,"date_updated":"2023-02-21T16:28:26Z","publication_identifier":{"isbn":["9783642392115"],"issn":["1611-3349"]},"related_material":{"record":[{"id":"11793","status":"public","relation":"later_version"}]},"alternative_title":["LNCS"],"conference":{"end_date":"2013-07-12","start_date":"2013-07-08","name":"ICALP: International Colloquium on Automata, Languages, and Programming","location":"Riga, Latvia"},"doi":"10.1007/978-3-642-39212-2_53","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"}],"_id":"11793","abstract":[{"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 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”.\r\n\r\nOur 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.","lang":"eng"}],"publication":"40th International Colloquium on Automata, Languages, and Programming","publication_status":"published","day":"01","year":"2013","publisher":"Springer Nature","date_published":"2013-07-01T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"      7966","title":"Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks","quality_controlled":"1","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1512.08147"}],"oa_version":"Preprint"}