{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:26:20Z","timestamp":1743117980264,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031754081"},{"type":"electronic","value":"9783031754098"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_17","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:25Z","timestamp":1737497425000},"page":"236-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lightweight Near-Additive Spanners"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Gitlitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ofer","family":"Neiman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4382-466X","authenticated-orcid":false,"given":"Richard","family":"Spence","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Abboud, A., Bodwin, G.: The 4\/3 additive spanner exponent is tight. J. ACM 64(4), 28:1\u201328:20 (2017). https:\/\/doi.org\/10.1145\/3088511","DOI":"10.1145\/3088511"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Abboud, A., Bodwin, G., Pettie, S.: A hierarchy of lower bounds for sublinear additive spanners. In: Klein, P.N. (ed.) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, 16\u201319 January, pp. 568\u2013576. SIAM (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.36","DOI":"10.1137\/1.9781611974782.36"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Ahmed, R., Bodwin, G., Hamm, K., Kobourov, S., Spence, R.: On additive spanners in weighted graphs with local error. In: 47th International Workshop on Graph-Theoretic Concepts in Computer Science (2021)","DOI":"10.1007\/978-3-030-86838-3_28"},{"key":"17_CR4","doi-asserted-by":"publisher","unstructured":"Ahmed, R., et al.: Graph spanners: a tutorial review. Comput. Sci. Rev. 37, 100\u2013253 (2020). https:\/\/doi.org\/10.1016\/j.cosrev.2020.100253. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1574013719302539","DOI":"10.1016\/j.cosrev.2020.100253"},{"key":"17_CR5","doi-asserted-by":"publisher","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, 1167\u20131181 (1999). https:\/\/doi.org\/10.1137\/S0097539796303421","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discret. Comput. Geom. 9(1), 81\u2013100 (1993). https:\/\/doi.org\/10.1007\/BF02189308","journal-title":"Discret. Comput. Geom."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/J.JCSS.2019.04.006","volume":"105","author":"Y Bartal","year":"2019","unstructured":"Bartal, Y., Filtser, A., Neiman, O.: On notions of distortion and an almost minimum spanning tree with constant average distortion. J. Comput. Syst. Sci. 105, 116\u2013129 (2019). https:\/\/doi.org\/10.1016\/J.JCSS.2019.04.006","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"17_CR8","first-page":"5","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 (TALG) 7(1), 5 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"17_CR9","doi-asserted-by":"publisher","unstructured":"Bodwin, G.: An alternate proof of near-optimal light spanners. CoRR abs\/2305.18647 (2023). https:\/\/doi.org\/10.48550\/arXiv.2305.18647","DOI":"10.48550\/arXiv.2305.18647"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Bodwin, G., Williams, V.V.: Very sparse additive spanners and emulators. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, pp. 377\u2013382. Association for Computing Machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2688073.2688103","DOI":"10.1145\/2688073.2688103"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Borradaile, G., Le, H., Wulff-Nilsen, C.: Minor-free graphs have light spanners. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science, FOCS 2017, pp. 767\u2013778 (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.76","DOI":"10.1109\/FOCS.2017.76"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Borradaile, G., Le, H., Wulff-Nilsen, C.: Greedy spanners are optimal in doubling metrics. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, pp. 2371\u20132379 (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.145","DOI":"10.1137\/1.9781611975482.145"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Chandra, B., Das, G., Narasimhan, G., Soares, J.: New sparseness results on graph spanners. In: Proceedings of the Eighth Annual Symposium on Computational Geometry, pp. 192\u2013201. ACM (1992)","DOI":"10.1145\/142675.142717"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Chechik, S.: New additive spanners. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 498\u2013512. Society for Industrial and Applied Mathematics (2013)","DOI":"10.1137\/1.9781611973105.36"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Chechik, S., Wulff-Nilsen, C.: Near-optimal light spanners. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 883\u2013892. Society for Industrial and Applied Mathematics (2016)","DOI":"10.1137\/1.9781611974331.ch63"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"Elkin, M., Gitlitz, Y., Neiman, O.: Almost shortest paths with near-additive error in weighted graphs. In: Czumaj, A., Xin, Q. (eds.) 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, T\u00f3rshavn, Faroe Islands, 27\u201329 June 2022. LIPIcs, vol.\u00a0227, pp. 23:1\u201323:22. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.SWAT.2022.23","DOI":"10.4230\/LIPICS.SWAT.2022.23"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/S00446-022-00433-X","volume":"36","author":"M Elkin","year":"2023","unstructured":"Elkin, M., Gitlitz, Y., Neiman, O.: Improved weighted additive spanners. Distrib. Comput. 36(3), 385\u2013394 (2023). https:\/\/doi.org\/10.1007\/S00446-022-00433-X","journal-title":"Distrib. Comput."},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Elkin, M., Neiman, O.: Efficient algorithms for constructing very sparse spanners and emulators. ACM Trans. Algorithms 15(1), 4:1\u20134:29 (2019). https:\/\/doi.org\/10.1145\/3274651","DOI":"10.1145\/3274651"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Elkin, M., Neiman, O., Solomon, S.: Light spanners. In: International Colloquium on Automata, Languages, and Programming, pp. 442\u2013452. Springer (2014)","DOI":"10.1007\/978-3-662-43948-7_37"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Elkin, M., Peleg, D.: $$(1+\\varepsilon ,\\beta )$$-spanner constructions for general graphs. SIAM J. Comput. 33(3), 608\u2013631 (2004). https:\/\/doi.org\/10.1137\/S0097539701393384","DOI":"10.1137\/S0097539701393384"},{"key":"17_CR21","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: Proceedings of the Symposium on Theory of Graphs and its Applications, pp. 29\u201336 (1963)"},{"key":"17_CR22","unstructured":"Filtser, A., Gitlitz, Y., Neiman, O.: Light, reliable spanners. In: SOCG 2024 (2024, to apear)"},{"issue":"10","key":"17_CR23","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1007\/S00453-022-00994-0","volume":"84","author":"A Filtser","year":"2022","unstructured":"Filtser, A., Neiman, O.: Light spanners for high dimensional norms via stochastic decompositions. Algorithmica 84(10), 2987\u20133007 (2022). https:\/\/doi.org\/10.1007\/S00453-022-00994-0","journal-title":"Algorithmica"},{"key":"17_CR24","doi-asserted-by":"publisher","unstructured":"Filtser, A., Solomon, S.: The greedy spanner is existentially optimal. SIAM J. Comput. 49(2), 429\u2013447 (2020). https:\/\/doi.org\/10.1137\/18M1210678, preliminary version published in PODC 2016","DOI":"10.1137\/18M1210678"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Gottlieb, L.: A light metric spanner. In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17\u201320 October 2015, pp. 759\u2013772 (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.52","DOI":"10.1109\/FOCS.2015.52"},{"issue":"4","key":"17_CR26","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01294129","volume":"14","author":"S Khuller","year":"1995","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning trees and shortest-path trees. Algorithmica 14(4), 305\u2013321 (1995)","journal-title":"Algorithmica"},{"key":"17_CR27","doi-asserted-by":"publisher","unstructured":"Le, H., Solomon, S.: A unified framework for light spanners. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, 20\u201323 June 2023, pp. 295\u2013308. ACM (2023). https:\/\/doi.org\/10.1145\/3564246.3585185","DOI":"10.1145\/3564246.3585185"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Neiman, O., Shabat, I.: A unified framework for hopsets. In: Chechik, S., Navarro, G., Rotenberg, E., Herman, G. (eds.) 30th Annual European Symposium on Algorithms, ESA 2022, Berlin\/Potsdam, Germany, 5\u20139 September 2022. LIPIcs, vol.\u00a0244, pp. 81:1\u201381:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.ESA.2022.81","DOI":"10.4230\/LIPICS.ESA.2022.81"},{"issue":"1","key":"17_CR29","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. J. Graph Theory 13(1), 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Pettie, S.: Low distortion spanners. ACM Trans. Algorithms 6(1), 7:1\u20137:22 (2009). https:\/\/doi.org\/10.1145\/1644015.1644022","DOI":"10.1145\/1644015.1644022"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Salowe, J.S.: Construction of multidimensional spanner graphs, with applications to minimum spanning trees. In: Proceedings of the Seventh Annual Symposium on Computational Geometry, SCG 1991, pp. 256\u2013261. Association for Computing Machinery, New York, NY, USA (1991). https:\/\/doi.org\/10.1145\/109648.109677","DOI":"10.1145\/109648.109677"},{"key":"17_CR32","doi-asserted-by":"publisher","unstructured":"Tan, Z., Zhang, T.: Almost-optimal sublinear additive spanners. In: Saha, B., Servedio, R.A. (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, 20\u201323 June 2023, pp. 281\u2013294. ACM (2023). https:\/\/doi.org\/10.1145\/3564246.3585125","DOI":"10.1145\/3564246.3585125"},{"issue":"1","key":"17_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1\u201324 (2005). https:\/\/doi.org\/10.1145\/1044731.1044732","journal-title":"J. ACM"},{"key":"17_CR34","doi-asserted-by":"publisher","unstructured":"Thorup, M., Zwick, U.: Spanners and emulators with sublinear distance errors. In: SODA 2006, pp. 802\u2013809 (2006). https:\/\/doi.org\/10.1145\/1109557.1109645","DOI":"10.1145\/1109557.1109645"},{"issue":"3","key":"17_CR35","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/BF02574695","volume":"6","author":"PM Vaidya","year":"1991","unstructured":"Vaidya, P.M.: A sparse graph almost as good as the complete graph on points in K dimensions. Discret. Comput. Geom. 6(3), 369\u2013381 (1991). https:\/\/doi.org\/10.1007\/BF02574695","journal-title":"Discret. Comput. Geom."},{"key":"17_CR36","doi-asserted-by":"crossref","unstructured":"Woodruff, D.: Additive spanners in nearly quadratic time. In: International Colloquium on Automata, Languages, and Programming, pp. 463\u2013474. Springer (2010)","DOI":"10.1007\/978-3-642-14165-2_40"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:31Z","timestamp":1737497431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}