{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T09:22:52Z","timestamp":1778664172199,"version":"3.51.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030340285","type":"print"},{"value":"9783030340292","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_35","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:02:40Z","timestamp":1573700560000},"page":"541-562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Approximation Algorithms and an Integer Program for Multi-level Graph Spanners"],"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":"Mohammad Javad","family":"Latifi Jebelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","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":[[2019,11,14]]},"reference":[{"key":"35_CR1","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":"35_CR2","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 90, pp. 26\u201337. Springer, Heidelberg (1990)"},{"issue":"7","key":"35_CR3","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1007\/s11590-018-1340-0","volume":"13","author":"Eduardo \u00c1lvarez-Miranda","year":"2018","unstructured":"\u00c1lvarez-Miranda, E., Sinnl, M.: Mixed-integer programming approaches for the tree t*-spanner problem. Optimization Letters (2018). https:\/\/doi.org\/10.1007\/s11590-018-1340-0","journal-title":"Optimization Letters"},{"issue":"7","key":"35_CR4","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."},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ic.2012.10.007","volume":"222","author":"Piotr Berman","year":"2013","unstructured":"Berman, P., Bhattacharyya, A., Makarychev, K., Raskhodnikova, S., Yaroslavtsev, G.: Approximation algorithms for spanner problems and directed steiner forest. Inf. Comput. 222, 93\u2013107 (2013). 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), https:\/\/doi.org\/10.1016\/j.ic.2012.10.007 , http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540112001484","journal-title":"Information and Computation"},{"issue":"6","key":"35_CR6","doi-asserted-by":"publisher","first-page":"1380","DOI":"10.1137\/110826655","volume":"41","author":"A Bhattacharyya","year":"2012","unstructured":"Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. SIAM J. Comput. 41(6), 1380\u20131425 (2012). https:\/\/doi.org\/10.1137\/110826655","journal-title":"SIAM J. Comput."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Bodwin, G.: Linear size distance preservers. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 600\u2013615. Society for Industrial and Applied Mathematics (2017)","DOI":"10.1137\/1.9781611974782.39"},{"issue":"2","key":"35_CR8","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.S., Schieber, B.: Resource optimization in QoS multicast routing of real-time multimedia. IEEE\/ACM Trans. Networking 12(2), 340\u2013348 (2004). https:\/\/doi.org\/10.1109\/TNET.2004.826288","journal-title":"IEEE\/ACM Trans. Networking"},{"issue":"2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/1361192.1361200","volume":"4","author":"J Chuzhoy","year":"2008","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","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"35_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1137\/050630696","volume":"20","author":"D Coppersmith","year":"2006","unstructured":"Coppersmith, D., Elkin, M.: Sparse sourcewise and pairwise distance preservers. SIAM J. Discrete Math. 20(2), 463\u2013501 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR11","doi-asserted-by":"publisher","unstructured":"Cygan, M., Grandoni, F., Kavitha, T.: On pairwise spanners. In: Portier, N., Wilke, T. (eds.) 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol. 20, pp. 209\u2013220. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2013). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2013.209 , http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/3935","DOI":"10.4230\/LIPIcs.STACS.2013.209"},{"issue":"1","key":"35_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"P David","year":"1989","unstructured":"David, P., Alejandro, S.A.: Graph spanners. J. Graph Theory 13(1), 99\u2013116 (1989). https:\/\/doi.org\/10.1002\/jgt.3190130114 . https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/jgt.3190130114","journal-title":"J. Graph Theory"},{"key":"35_CR13","doi-asserted-by":"publisher","unstructured":"Dinitz, M., Krauthgamer, R.: Directed spanners via flow-based linear programs. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing. STOC 2011, pp. 323\u2013332. ACM, New York (2011). https:\/\/doi.org\/10.1145\/1993636.1993680 , http:\/\/doi.acm.org\/10.1145\/1993636.1993680","DOI":"10.1145\/1993636.1993680"},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs, i. Publicationes Mathematicae (Debrecen) 6, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae (Debrecen)"},{"issue":"3","key":"35_CR15","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/s00453-001-0021-y","volume":"30","author":"G Kortsarz","year":"2001","unstructured":"Kortsarz, G.: On the hardness of approximating spanners. Algorithmica 30(3), 432\u2013450 (2001). https:\/\/doi.org\/10.1007\/s00453-001-0021-y . https:\/\/doi.org\/10.1007\/s00453-001-0021-y","journal-title":"Algorithmica"},{"issue":"3","key":"35_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1287\/ijoc.8.3.202","volume":"8","author":"P Mirchandani","year":"1996","unstructured":"Mirchandani, P.: The multi-tier tree problem. INFORMS J. Comput. 8(3), 202\u2013218 (1996)","journal-title":"INFORMS J. Comput."},{"key":"35_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1007\/978-3-540-30140-0_70","volume-title":"Algorithms \u2013 ESA 2004","author":"M Sigurd","year":"2004","unstructured":"Sigurd, M., Zachariasen, M.: Construction of minimum-weight spanners. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 797\u2013808. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_70"},{"issue":"6684","key":"35_CR18","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T22:39:22Z","timestamp":1695422362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","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":"45","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":"35","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":"78% - 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":"2","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":"2","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)"}}]}}