{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:29:41Z","timestamp":1743110981642,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_21","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"297-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Sourcewise Roundtrip Spanners with\u00a0Constant Stretch"],"prefix":"10.1007","author":[{"given":"Eli","family":"Stafford","sequence":"first","affiliation":[]},{"given":"Chunjiang","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","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":"21_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Althofer","year":"1993","unstructured":"Althofer, I., Das, G., Dobkin, D.P., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 81\u2013100 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"1","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(1), 1\u201326 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Bodwin, G.: Linear size distance preservers. In: Proceedings of SODA Conference, pp. 600\u2013615 (2017)","DOI":"10.1137\/1.9781611974782.39"},{"key":"21_CR5","unstructured":"Cen, R., Duan, R., Gu, Y.: Roundtrip spanners with $$(2k-1)$$ stretch. In: Proceedings of ICALP Conference, pp. 24:1\u201324:11 (2020)"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1137\/050630696","volume":"20","author":"D Coppersmith","year":"2006","unstructured":"Coppersmith, D., Elkin, M.: Sparse source-wise and pair-wise preservers. SIAM J. Discret. Math. 20(2), 463\u2013501 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Chechik, S.: New additive spanners. In: Proceedings of SIAM SODA Conference, pp. 498\u2013512 (2013)","DOI":"10.1137\/1.9781611973105.36"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Chechik, S., Lifshitz, G.: Optimal girth approximation for dense directed graphs. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 290\u2013300. SIAM (2021)","DOI":"10.1137\/1.9781611976465.19"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Chechik, S., Liu, Y.P., Rotem, O., Sidford, A.: Constant girth approximation for directed graphs in subquadratic time. In: Proceedings of STOC Conference, pp. 1010\u20131023 (2020)","DOI":"10.1145\/3357713.3384330"},{"key":"21_CR10","unstructured":"Dalirrooyfard, M., Williams, V.V.: Conditionally optimal approximation algorithms for the girth of a directed graph. In: Proceedings of ICALP Conference, pp. 35:1\u201335:20 (2020)"},{"issue":"3","key":"21_CR11","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 graph. SIAM J. Comput. 33(3), 608\u2013631 (2004)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1644015.1644022","volume":"6","author":"S Pettie","year":"2009","unstructured":"Pettie, S.: Low distortion spanners. ACM Trans. Algorithms 6(1), 1\u201322 (2009)","journal-title":"ACM Trans. Algorithms"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Pachocki, J., Roditty, L., Sidford, A., Tov, R., Williams, V.: Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners. In: Proceedings of SODA Conference, pp. 1374\u20131392 (2018)","DOI":"10.1137\/1.9781611975031.91"},{"issue":"1","key":"21_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Schaffer, A.A.: Graph spanners. J. Graph Theory 13(1), 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/11523468_22","volume-title":"Automata, Languages and Programming","author":"L Roditty","year":"2005","unstructured":"Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 261\u2013272. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_22"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1367064.1367069","volume":"4","author":"I Roditty","year":"2008","unstructured":"Roditty, I., Thorup, M., Zwick, U.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4(3), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1963","DOI":"10.1109\/TNET.2010.2053381","volume":"18","author":"H Shpungin","year":"2010","unstructured":"Shpungin, H., Segal, M.: Near-optimal multicriteria spanner constructions in wireless ad hoc networks. IEEE\/ACM Trans. Netw. 18(6), 1963\u20131976 (2010)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"21_CR18","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)","journal-title":"J. ACM"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Woodruff, D.P.: Additive spanners in nearly quadratic time. In: Proceedings of ICALP Conference, pp. 463\u2013474 (2010)","DOI":"10.1007\/978-3-642-14165-2_40"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2021.05.019","volume":"876","author":"CJ Zhu","year":"2021","unstructured":"Zhu, C.J., Han, S., Lam, K.-Y.: A fast algorithm for source-wise round-trip spanners. Theor. Comput. Sci. 876, 34\u201344 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.ipl.2017.04.009","volume":"124","author":"C Zhu","year":"2017","unstructured":"Zhu, C., Lam, K.: Source-wise round-trip spanners. Inf. Process. Lett. 124, 42\u201345 (2017)","journal-title":"Inf. Process. Lett."},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ipl.2017.09.008","volume":"127","author":"C Zhu","year":"2018","unstructured":"Zhu, C., Lam, K.: Deterministic improved round-trip spanners. Inf. Process. Lett. 127, 57\u201360 (2018)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:10:54Z","timestamp":1702026654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}