{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:58:51Z","timestamp":1774022331397,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031343469","type":"print"},{"value":"9783031343476","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_1","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-priority Graph Sparsification"],"prefix":"10.1007","author":[{"given":"Reyan","family":"Ahmed","sequence":"first","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":"Mohammad Javad Latifi","family":"Jebelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faryad Darabi","family":"Sahneh","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":[[2023,6,3]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abboud, A., Bodwin, G.: Lower bound amplification theorems for graph spanners. In: Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841\u2013856 (2016)","DOI":"10.1137\/1.9781611974331.ch60"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"28","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), 28 (2017)","journal-title":"J. ACM (JACM)"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Ahmed, A.R., et al.: Multi-level Steiner trees. In: 17th International Symposium on Experimental Algorithms (SEA), pp. 15:1\u201315:14 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2018.15","DOI":"10.4230\/LIPIcs.SEA.2018.15"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-030-86838-3_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R Ahmed","year":"2021","unstructured":"Ahmed, R., Bodwin, G., Hamm, K., Kobourov, S., Spence, R.: On additive spanners in weighted graphs with local error. In: Kowalik, \u0141, Pilipczuk, M., Rz\u0105\u017cewski, P. (eds.) WG 2021. LNCS, vol. 12911, pp. 361\u2013373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86838-3_28"},{"key":"1_CR5","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":"1_CR6","doi-asserted-by":"publisher","unstructured":"Ahmed, R., Bodwin, G., Sahneh, F.D., Hamm, K., Kobourov, S., Spence, R.: Multi-level weighted additive spanners. In: Coudert, D., Natale, E. (eds.) 19th International Symposium on Experimental Algorithms (SEA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 190, pp. 16:1\u201316:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2021.16. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/13788","DOI":"10.4230\/LIPIcs.SEA.2021.16"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-030-34029-2_35","volume-title":"Analysis of Experimental Algorithms","author":"R Ahmed","year":"2019","unstructured":"Ahmed, R., Hamm, K., Latifi Jebelli, M.J., Kobourov, S., Sahneh, F.D., Spence, R.: Approximation algorithms and an integer program for multi-level graph spanners. In: Kotsireas, I., Pardalos, P., Parsopoulos, K.E., Souravlias, D., Tsokas, A. (eds.) SEA 2019. LNCS, vol. 11544, pp. 541\u2013562. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34029-2_35"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Ahmed, R., Hamm, K., Kobourov, S., Jebelli, M.J.L., Sahneh, F.D., Spence, R.: Multi-priority graph sparsification. arXiv preprint arXiv:2301.12563 (2023)","DOI":"10.1007\/978-3-031-34347-6_1"},{"key":"1_CR9","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":"1_CR10","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."},{"issue":"7","key":"1_CR11","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/mnsc.40.7.846","volume":"40","author":"A Balakrishnan","year":"1994","unstructured":"Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Modeling and heuristic worst-case performance analysis of the two-level network design problem. Manag. Sci. 40(7), 846\u2013867 (1994). https:\/\/doi.org\/10.1287\/mnsc.40.7.846","journal-title":"Manag. Sci."},{"issue":"1","key":"1_CR12","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)"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1137\/19M123662X","volume":"50","author":"G Bodwin","year":"2021","unstructured":"Bodwin, G.: New results on linear size distance preservers. SIAM J. Comput. 50(2), 662\u2013673 (2021). https:\/\/doi.org\/10.1137\/19M123662X","journal-title":"SIAM J. Comput."},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1\u20136:33 (2013). https:\/\/doi.org\/10.1145\/2432622.2432628","DOI":"10.1145\/2432622.2432628"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/TNET.2004.826288","volume":"12","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Naor, J., Schieber, B.: Resource optimization in QoS multicast routing of real-time multimedia. IEEE\/ACM Trans. Netw. 12(2), 340\u2013348 (2004). https:\/\/doi.org\/10.1109\/TNET.2004.826288","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Chechik, S.: New additive spanners. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 498\u2013512. Society for Industrial and Applied Mathematics (2013)","DOI":"10.1137\/1.9781611973105.36"},{"issue":"3","key":"1_CR17","first-page":"33","volume":"14","author":"S Chechik","year":"2018","unstructured":"Chechik, S., Wulff-Nilsen, C.: Near-optimal light spanners. ACM Trans. Algorithms (TALG) 14(3), 33 (2018)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Chuzhoy, J., Gupta, A., Naor, J.S., Sinha, A.: On the approximability of some network design problems. ACM Trans. Algorithms 4(2), 23:1\u201323:17 (2008). https:\/\/doi.org\/10.1145\/1361192.1361200","DOI":"10.1145\/1361192.1361200"},{"key":"1_CR19","unstructured":"Elkin, M., Gitlitz, Y., Neiman, O.: Almost shortest paths and PRAM distance oracles in weighted graphs. arXiv preprint arXiv:1907.11422 (2019)"},{"key":"1_CR20","unstructured":"Elkin, M., Gitlitz, Y., Neiman, O.: Improved weighted additive spanners. arXiv preprint arXiv:2008.09877 (2020)"},{"key":"1_CR21","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":"1_CR22","unstructured":"Hauptmann, M., Karpi\u0144ski, M.: A compendium on Steiner tree problems. Inst. f\u00fcr Informatik (2013)"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00453-004-1133-y","volume":"42","author":"M Karpinski","year":"2005","unstructured":"Karpinski, M., Mandoiu, I.I., Olshevsky, A., Zelikovsky, A.: Improved approximation algorithms for the quality of service multicast tree problem. Algorithmica 42(2), 109\u2013120 (2005). https:\/\/doi.org\/10.1007\/s00453-004-1133-y","journal-title":"Algorithmica"},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1007\/s00224-016-9736-7","volume":"61","author":"T Kavitha","year":"2016","unstructured":"Kavitha, T.: New pairwise spanners. Theory Comput. Syst. 61(4), 1011\u20131036 (2016). https:\/\/doi.org\/10.1007\/s00224-016-9736-7","journal-title":"Theory Comput. Syst."},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Klein, P.N.: A subset spanner for planar graphs, with application to subset TSP. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2006, pp. 749\u2013756. ACM, New York (2006). https:\/\/doi.org\/10.1145\/1132516.1132620. http:\/\/doi.acm.org\/10.1145\/1132516.1132620","DOI":"10.1145\/1132516.1132620"},{"key":"1_CR26","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":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-22006-7_2","volume-title":"Automata, Languages and Programming","author":"B Laekhanukit","year":"2011","unstructured":"Laekhanukit, B.: An improved approximation algorithm for minimum-cost subset k-connectivity. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 13\u201324. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_2"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Le, H.: A PTAS for subset TSP in minor-free graphs. In: Proceedings of the Thirty-First Annual. Society for Industrial and Applied Mathematics, USA (2020)","DOI":"10.1137\/1.9781611975994.140"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Nutov, Z.: Approximating minimum cost connectivity problems via uncrossable bifamilies and spider-cover decompositions. In: IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS 2009), Los Alamitos, CA, USA. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.9. https:\/\/doi.ieeecomputersociety.org\/10.1109\/FOCS.2009.9","DOI":"10.1109\/FOCS.2009.9"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.jda.2012.08.001","volume":"17","author":"Z Nutov","year":"2012","unstructured":"Nutov, Z.: Approximating subset k-connectivity problems. J. Discret. Algorithms 17, 51\u201359 (2012)","journal-title":"J. Discret. Algorithms"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Sahneh, F.D., Kobourov, S., Spence, R.: Approximation algorithms for the priority Steiner tree problem. In: 27th International Computing and Combinatorics Conference (COCOON) (2021). http:\/\/arxiv.org\/abs\/1811.11700","DOI":"10.1007\/978-3-030-89543-3_10"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34347-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T19:11:55Z","timestamp":1729537915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","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":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","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","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"33","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":"38% - 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.04","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":"5.69","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)"}}]}}