{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:36Z","timestamp":1740109296558,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T00:00:00Z","timestamp":1595894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T00:00:00Z","timestamp":1595894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["894\/09"],"award-info":[{"award-number":["894\/09"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2008348"],"award-info":[{"award-number":["2008348"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005386","name":"I-CORE","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005386","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006245","name":"Ministry of Science and Technology, Israel","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006245","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006461","name":"Citi Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006461","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Google European Fellowship"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s00453-020-00734-2","type":"journal-article","created":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T10:04:06Z","timestamp":1595930646000},"page":"3458-3491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fault Tolerant Approximate BFS Structures with Additive Stretch"],"prefix":"10.1007","volume":"82","author":[{"given":"Merav","family":"Parter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"issue":"4","key":"734_CR1","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1137\/S0097539796303421","volume":"28","author":"D Aingworth","year":"1999","unstructured":"Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM J. Comput. 28(4), 1167\u20131181 (1999)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"734_CR2","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1145\/1198513.1198518","volume":"2","author":"S Baswana","year":"2006","unstructured":"Baswana, S., Sen, S.: Approximate distance oracles for unweighted graphs in expected $$O(n^2)$$ time. ACM Trans. Algorithms 2(4), 557\u2013577 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"734_CR3","unstructured":"Baswana, S., Khanna, N.: Approximate shortest paths avoiding a failed vertex: optimal size data structures for unweighted graph. In: Proceedings of the 27th Symposium on Theoretical Aspects of Computer Science, pp. 513\u2013524 (2010)"},{"key":"734_CR4","doi-asserted-by":"crossref","first-page":"A5","DOI":"10.1145\/1868237.1868242","volume":"7","author":"S Baswana","year":"2010","unstructured":"Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: Additive spanners and $$(\\alpha, \\beta )$$-spanners. ACM Trans. Algorithms 7, A5 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"734_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, A.: A nearly optimal algorithm for approximating replacement paths and k shortest simple paths in general graphs. In: Proceedings of the 21st ACM-SIAM Symposium on Discrete Algorithms (2010)","DOI":"10.1137\/1.9781611973075.61"},{"key":"734_CR6","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, D., Grandoni, F., Gual\u00e0, L., Leucci, S., Proietti, G.: Improved purely additive fault-tolerant spanners. In: ESA (2015)","DOI":"10.1007\/978-3-662-48350-3_15"},{"key":"734_CR7","doi-asserted-by":"crossref","unstructured":"Braunschvig, G., Chechik, S., Peleg, D.: Fault tolerant additive spanners. In: Proceedings of 38th Workshop on Graph-Theoretic Concepts in Computer Science, pp. 206\u2013214 (2012)","DOI":"10.1007\/978-3-642-34611-8_22"},{"key":"734_CR8","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1007\/s00453-011-9543-0","volume":"63","author":"S Chechik","year":"2012","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: $$f$$-sensitivity distance oracles and routing schemes. Algorithmica 63, 861\u2013882 (2012)","journal-title":"Algorithmica"},{"key":"734_CR9","doi-asserted-by":"crossref","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault-tolerant spanners for general graphs. In; Proceedings of the 41st ACM Symposium on Theory of Computing, pp. 435\u2013444 (2009)","DOI":"10.1145\/1536414.1536475"},{"key":"734_CR10","doi-asserted-by":"crossref","unstructured":"Chechik, S.: New additive spanners. In: Proceedings of the 24th Symposium on Discrete Algorithms(2013)","DOI":"10.1137\/1.9781611973105.36"},{"key":"734_CR11","unstructured":"Cygan, M., Grandoni, F., Kavitha, T.: On Pairwise spanners. In: Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science, pp. 209\u2013220 (2013)"},{"key":"734_CR12","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Krauthgamer, R.: Fault-tolerant spanners: better and simpler. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, pp. 169-178 (2011)","DOI":"10.1145\/1993806.1993830"},{"key":"734_CR13","unstructured":"Erdos, P.: Extremal problems in graph theory. Theory of Graphs and its Applications (Proceedings Symposium Smolenice, 1963), p. 2936 (1963)"},{"key":"734_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, Berlin (2001)"},{"key":"734_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20059","volume":"49","author":"KE Mellinger","year":"2005","unstructured":"Mellinger, K.E., Mubayi, D.: Constructions of bipartite graphs from finite geometries. J. Graph Theory 49, 1\u201310 (2005)","journal-title":"J. Graph Theory"},{"key":"734_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2976741","volume":"13","author":"M Parter","year":"2016","unstructured":"Parter, M., Peleg, D.: Sparse fault-tolerant BFS structures. ACM Trans. Algorithms 13, 1\u201324 (2016)","journal-title":"ACM Trans. Algorithms"},{"key":"734_CR17","doi-asserted-by":"crossref","unstructured":"Parter, M., Peleg, D.: Fault tolerant approximate BFS structures. In: SODA (2014)","DOI":"10.1137\/1.9781611973402.80"},{"key":"734_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3022730","volume":"14","author":"M Parter","year":"2017","unstructured":"Parter, M., Peleg, D.: Fault tolerant approximate BFS structures. ACM Trans. Algorithms 14, 1\u201315 (2017)","journal-title":"ACM Trans. Algorithms"},{"key":"734_CR19","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s00446-015-0252-9","volume":"30","author":"M Parter","year":"2017","unstructured":"Parter, M.: Vertex fault tolerant additive spanners. Distrib. Comput. 30, 357\u2013372 (2017)","journal-title":"Distrib. Comput."},{"key":"734_CR20","doi-asserted-by":"crossref","unstructured":"P\u01cetra\u015fcu, M., Roditty, L.:. Distance oracles beyond the Thorup-Zwick bound. In: Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 815\u2013823 (2010)","DOI":"10.1109\/FOCS.2010.83"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00734-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00734-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00734-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T23:36:25Z","timestamp":1627428985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00734-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,28]]},"references-count":20,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["734"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00734-2","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2020,7,28]]},"assertion":[{"value":"16 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 June 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}