{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:25:17Z","timestamp":1742930717934,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030868376"},{"type":"electronic","value":"9783030868383"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86838-3_28","type":"book-chapter","created":{"date-parts":[[2021,9,19]],"date-time":"2021-09-19T22:05:30Z","timestamp":1632089130000},"page":"361-373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Additive Spanners in Weighted Graphs with Local Error"],"prefix":"10.1007","author":[{"given":"Reyan","family":"Ahmed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greg","family":"Bodwin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keaton","family":"Hamm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard","family":"Spence","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,20]]},"reference":[{"issue":"4","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3088511","volume":"64","author":"A Abboud","year":"2017","unstructured":"Abboud, A., Bodwin, G.: The 4\/3 additive spanner exponent is tight. J. ACM (JACM) 64(4), 1\u201320 (2017)","journal-title":"J. ACM (JACM)"},{"key":"28_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-030-60440-0_32","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R Ahmed","year":"2020","unstructured":"Ahmed, R., Bodwin, G., Darabi Sahneh, F., Kobourov, S., Spence, R.: Weighted additive spanners. In: Adler, I., M\u00fcller, H. (eds.) WG 2020. LNCS, vol. 12301, pp. 401\u2013413. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60440-0_32"},{"key":"28_CR3","unstructured":"Ahmed, R., Bodwin, G., Hamm, K., Kobourov, S., Spence, R.: Weighted sparse and lightweight spanners with local additive error. arXiv preprint arXiv:2103.09731 (2021)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"100253","DOI":"10.1016\/j.cosrev.2020.100253","volume":"37","author":"R Ahmed","year":"2020","unstructured":"Ahmed, R., et al.: Graph spanners: a tutorial review. Comput. Sci. Rev. 37, 100253 (2020)","journal-title":"Comput. Sci. Rev."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Ahmed, R., Bodwin, G., Sahneh, F.D., Hamm, K., Kobourov, S., Spence, R.: Multi-level weighted additive spanners. arXiv preprint arXiv:2102.05831 (2021)","DOI":"10.1007\/978-3-030-60440-0_32"},{"key":"28_CR6","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)","journal-title":"SIAM J. Comput."},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-52846-6_75","volume-title":"SWAT 90","author":"I Alth\u00f6fer","year":"1990","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D.: Generating sparse spanners for weighted graphs. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol. 447, pp. 26\u201337. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-52846-6_75"},{"issue":"1","key":"28_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":"28_CR9","unstructured":"Bodwin, G.: A note on distance-preserving graph sparsification. arXiv preprint arXiv:2001.07741 (2020)"},{"issue":"6","key":"28_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1142\/S0218195997000326","volume":"7","author":"L Cai","year":"1997","unstructured":"Cai, L., Keil, J.M.: Computing visibility information in an inaccurate simple polygon. Int. J. Comput. Geom. Appl. 7(6), 515\u2013538 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-662-53426-7_10","volume-title":"Distributed Computing","author":"K Censor-Hillel","year":"2016","unstructured":"Censor-Hillel, K., Kavitha, T., Paz, A., Yehudayoff, A.: Distributed construction of purely additive spanners. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 129\u2013142. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_10"},{"key":"28_CR12","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":"28_CR13","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":"28_CR14","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":"28_CR15","unstructured":"Cygan, M., Grandoni, F., Kavitha, T.: On pairwise spanners. In: Proceedings of 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), vol. 20, pp. 209\u2013220 (2013)"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1177\/0278364913498292","volume":"33","author":"A Dobson","year":"2014","unstructured":"Dobson, A., Bekris, K.E.: Sparse roadmap spanners for asymptotically near-optimal motion planning. Int. J. Robot. Res. 33(1), 18\u201347 (2014)","journal-title":"Int. J. Robot. Res."},{"issue":"5","key":"28_CR17","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/S0097539797327908","volume":"29","author":"D Dor","year":"2000","unstructured":"Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Comput. 29(5), 1740\u20131759 (2000)","journal-title":"SIAM J. Comput."},{"key":"28_CR18","unstructured":"Elkin, M., Gitlitz, Y., Neiman, O.: Almost shortest paths and PRAM distance oracles in weighted graphs. arXiv preprint arXiv:1907.11422 (2019)"},{"key":"28_CR19","unstructured":"Elkin, M., Gitlitz, Y., Neiman, O.: Improved weighted additive spanners. arXiv preprint arXiv:2008.09877 (2020)"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-662-43948-7_37","volume-title":"Automata, Languages, and Programming","author":"M Elkin","year":"2014","unstructured":"Elkin, M., Neiman, O., Solomon, S.: Light spanners. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 442\u2013452. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_37"},{"issue":"3","key":"28_CR21","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1137\/S0097539701393384","volume":"33","author":"M Elkin","year":"2004","unstructured":"Elkin, M., Peleg, D.: $$(1 + \\epsilon ,\\beta )$$-spanner constructions for general graphs. SIAM J. Comput. 33(3), 608\u2013631 (2004)","journal-title":"SIAM J. Comput."},{"key":"28_CR22","unstructured":"Erd\u0151s, P.: Extremal problems in graph theory. In: Proceedings of the Symposium on Theory of Graphs and its Applications, p. 2936 (1963)"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Filtser, A., Solomon, S.: The greedy spanner is existentially optimal. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp. 9\u201317. ACM (2016)","DOI":"10.1145\/2933057.2933114"},{"issue":"4","key":"28_CR24","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s00224-016-9736-7","volume":"61","author":"T Kavitha","year":"2017","unstructured":"Kavitha, T.: New pairwise spanners. Theory Comput. Syst. 61(4), 1011\u20131036 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"28_CR25","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1137\/140953927","volume":"29","author":"T Kavitha","year":"2015","unstructured":"Kavitha, T., Varma, N.M.: Small stretch pairwise spanners and approximate $$d$$-preservers. SIAM J. Discrete Math. 29(4), 2239\u20132254 (2015)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"28_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":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-319-08404-6_24","volume-title":"Algorithm Theory \u2013 SWAT 2014","author":"MBT Knudsen","year":"2014","unstructured":"Knudsen, M.B.T.: Additive spanners: a simple construction. In: Ravi, R., G\u00f8rtz, I.L. (eds.) SWAT 2014. LNCS, vol. 8503, pp. 277\u2013281. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08404-6_24"},{"key":"28_CR28","unstructured":"Le, H., Solomon, S.: A unified and fine-grained approach for light spanners. arXiv preprint arXiv:2008.10582 (2020)"},{"issue":"2","key":"28_CR29","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/TRO.2012.2234312","volume":"29","author":"JD Marble","year":"2013","unstructured":"Marble, J.D., Bekris, K.E.: Asymptotically near-optimal planning with probabilistic roadmap spanners. IEEE Trans. Robot. 29(2), 432\u2013444 (2013)","journal-title":"IEEE Trans. Robot."},{"issue":"1","key":"28_CR30","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"},{"issue":"3","key":"28_CR31","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM (JACM) 36(3), 510\u2013530 (1989)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"28_CR32","first-page":"7","volume":"6","author":"S Pettie","year":"2009","unstructured":"Pettie, S.: Low distortion spanners. ACM Trans. Algorithms (TALG) 6(1), 7 (2009)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"14","key":"28_CR33","doi-asserted-by":"publisher","first-page":"1711","DOI":"10.1177\/0278364914556517","volume":"33","author":"O Salzman","year":"2014","unstructured":"Salzman, O., Shaharabani, D., Agarwal, P.K., Halperin, D.: Sparsification of motion-planning roadmaps by edge contraction. Int. J. Robot. Res. 33(14), 1711\u20131725 (2014)","journal-title":"Int. J. Robot. Res."},{"key":"28_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-14165-2_40","volume-title":"Automata, Languages and Programming","author":"DP Woodruff","year":"2010","unstructured":"Woodruff, D.P.: Additive spanners in nearly quadratic time. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 463\u2013474. Springer, Heidelberg (2010). https:\/\/doi.org\/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-030-86838-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T20:03:58Z","timestamp":1702065838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86838-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030868376","9783030868383"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86838-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 September 2021","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":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair and OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held online due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}