{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T13:15:48Z","timestamp":1767878148038,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030364113","type":"print"},{"value":"9783030364120","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-36412-0_47","type":"book-chapter","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:04:15Z","timestamp":1575572655000},"page":"576-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Graph Simplification for Infrastructure Network Design"],"prefix":"10.1007","author":[{"given":"Sean","family":"Yaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard S.","family":"Middleton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Hoover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"issue":"1","key":"47_CR1","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)","journal-title":"Discret. Comput. Geom."},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"Bodwin, G.: Linear size distance preservers. In: Proceedings of the 2017 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 600\u2013615 (2017)","DOI":"10.1137\/1.9781611974782.39"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Bodwin, G., Williams, V.V.: Better distance preservers and additive spanners. In: Proceedings of the 2016 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 855\u2013872 (2016)","DOI":"10.1137\/1.9781611974331.ch61"},{"issue":"7","key":"47_CR4","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom."},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Chew, P.: There is a planar graph almost as good as the complete graph. In: Proceedings of the Second Annual Symposium on Computational Geometry (SoCG), pp. 169\u2013177 (1986)","DOI":"10.1145\/10515.10534"},{"key":"47_CR6","unstructured":"Cygan, M., Grandoni, F., Kavitha, T.: On pairwise spanners. In: 30th International Symposium on Theoretical Aspects of Computer Science, p. 209 (2013)"},{"issue":"2","key":"47_CR7","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/2818375","volume":"12","author":"M Dinitz","year":"2015","unstructured":"Dinitz, M., Kortsarz, G., Raz, R.: Label cover instances with large girth and the hardness of approximating basic $$k$$-spanner. ACM Trans. Algorithms 12(2), 25:1\u201325:16 (2015)","journal-title":"ACM Trans. Algorithms"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Hoover, B., Middleton, R.S., Yaw, S.: $$CostMAP$$: an open-source software package for developing cost surfaces using a multi-scale search kernel. Int. J. Geogr. Inf. Sci. (2019)","DOI":"10.1080\/13658816.2019.1675885"},{"key":"47_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/978-3-642-39206-1_51","volume-title":"Automata, Languages, and Programming","author":"T Kavitha","year":"2013","unstructured":"Kavitha, T., Varma, N.M.: Small stretch pairwise spanners. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 601\u2013612. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39206-1_51"},{"issue":"1","key":"47_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187821","volume":"7","author":"JM Keil","year":"1992","unstructured":"Keil, J.M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discret. Comput. Geom. 7(1), 13\u201328 (1992)","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"47_CR11","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)","journal-title":"Algorithmica"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Manurangsi, P.: Almost-polynomial ratio ETH-hardness of approximating densest $$k$$-subgraph. In: Proceedings of the 2017 ACM SIGACT Symposium on Theory of Computing (STOC), pp. 954\u2013961 (2017)","DOI":"10.1145\/3055399.3055412"},{"issue":"3","key":"47_CR13","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1016\/j.enpol.2008.09.049","volume":"37","author":"RS Middleton","year":"2009","unstructured":"Middleton, R.S., Bielicki, J.M.: A scalable infrastructure model for carbon capture and storage: SimCCS. Energy Policy 37(3), 1052\u20131060 (2009)","journal-title":"Energy Policy"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"Middleton, R.S., Ellett, K., Stauffer, P., Rupp, J.: Making carbon capture, utilization and storage a reality: integrating science and engineering into a business plan framework. In: AAPG\u2014SEG International Conference and Exhibition (2015)","DOI":"10.1190\/ice2015-2211308"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"7328","DOI":"10.1039\/c2ee03227a","volume":"5","author":"MS Middleton","year":"2012","unstructured":"Middleton, M.S., et al.: The cross-scale science of CO$$_2$$ capture and storage: from pore scale to regional scale. Energy Environ. Sci. 5, 7328\u20137345 (2012)","journal-title":"Energy Environ. Sci."},{"issue":"1","key":"47_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.compenvurbsys.2011.08.002","volume":"36","author":"RS Middleton","year":"2012","unstructured":"Middleton, R.S., Kuby, M.J., Bielicki, J.M.: Generating candidate networks for optimization: the CO$$_2$$ capture and storage optimization problem. Comput. Environ. Urban Syst. 36(1), 18\u201329 (2012)","journal-title":"Comput. Environ. Urban Syst."},{"key":"47_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijggc.2017.12.011","volume":"70","author":"RS Middleton","year":"2018","unstructured":"Middleton, R.S., Yaw, S.: The cost of getting CCS wrong: uncertainty, infrastructure design, and stranded CO$$_2$$. Int. J. Greenhouse Gas Control 70, 1\u201311 (2018)","journal-title":"Int. J. Greenhouse Gas Control"},{"key":"47_CR18","doi-asserted-by":"crossref","unstructured":"Middleton, R.S., Yaw, S., Hoover, B., Ellett, K.: $$SimCCS$$: an open-source tool for optimizing CO$$_2$$ capture, transport, and storage infrastructure. Environ. Modell. Softw. (2019)","DOI":"10.1016\/j.envsoft.2019.104560"},{"key":"47_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms, chap. 3","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms, chap. 3, pp. 27\u201329. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/978-3-662-04565-7"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:14:45Z","timestamp":1575573285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_47","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":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","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":"108","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":"49","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":"45% - 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.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":"10","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)"}}]}}