{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:06:30Z","timestamp":1750694790384,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031069000"},{"type":"electronic","value":"9783031069017"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06901-7_5","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"57-69","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Simple LP-Based Approximation Algorithm for\u00a0the\u00a0Matching Augmentation Problem"],"prefix":"10.1007","author":[{"given":"\u00c9tienne","family":"Bamas","sequence":"first","affiliation":[]},{"given":"Marina","family":"Drygala","sequence":"additional","affiliation":[]},{"given":"Ola","family":"Svensson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"issue":"2","key":"5_CR1","first-page":"1","volume":"15","author":"D Adjiashvili","year":"2018","unstructured":"Adjiashvili, D.: Beating approximation factor two for weighted tree augmentation with bounded costs. ACM Trans. Algorithms (TALG) 15(2), 1\u201326 (2018)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"5_CR2","unstructured":"Alexander, A., Boyd, S., Elliott-Magwood, P.: On the integrality gap of the 2-edge connected subgraph problem. Technical report. Citeseer (2006)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Cecchetto, F., Traub, V., Zenklusen, R.: Bridging the gap between tree and connectivity augmentation: unified and stronger approaches. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 370\u2013383 (2021)","DOI":"10.1145\/3406325.3451086"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-019-01394-z","volume":"182","author":"J Cheriyan","year":"2020","unstructured":"Cheriyan, J., Dippel, J., Grandoni, F., Khan, A., Narayan, V.V.: The matching augmentation problem: a 7\/4-approximation algorithm. Math. Program. 182(1), 315\u2013354 (2020)","journal-title":"Math. Program."},{"key":"5_CR5","unstructured":"Cheriyan, J., Cummings, R., Dippel, J., Zhu, J.: An improved approximation algorithm for the matching augmentation problem. arXiv preprint arXiv:2007.11559 (2020)"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/s00453-016-0270-4","volume":"80","author":"J Cheriyan","year":"2018","unstructured":"Cheriyan, J., Gao, Z.: Approximating (unweighted) tree augmentation via lift-and-project, part i: stemless tap. Algorithmica 80(2), 530\u2013559 (2018)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s00453-017-0275-7","volume":"80","author":"J Cheriyan","year":"2018","unstructured":"Cheriyan, J., Gao, Z.: Approximating (unweighted) tree augmentation via lift-and-project, part ii. Algorithmica 80(2), 608\u2013651 (2018)","journal-title":"Algorithmica"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.orl.2008.01.009","volume":"36","author":"J Cheriyan","year":"2008","unstructured":"Cheriyan, J., Karloff, H., Khandekar, R., K\u00f6nemann, J.: On the integrality ratio for tree augmentation. Oper. Res. Lett. 36(4), 399\u2013401 (2008)","journal-title":"Oper. Res. Lett."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2013.04.004","volume":"489","author":"N Cohen","year":"2013","unstructured":"Cohen, N., Nutov, Z.: A (1+ ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theor. Comput. Sci. 489, 67\u201374 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33(1), 1\u201327 (1985)","journal-title":"Math. Program."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Even, G., Feldman, J., Kortsarz, G., Nutov, Z.: A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms (TALG) 5(2), 1\u201317 (2009)","DOI":"10.1145\/1497290.1497297"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Fiorini, S., Gro\u00df, M., K\u00f6nemann, J., Sanit\u00e0, L.: Approximating weighted tree augmentation via Chv\u00e1tal-Gomory cuts. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 817\u2013831. SIAM (2018)","DOI":"10.1137\/1.9781611975031.53"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(82)90059-7","volume":"19","author":"GN Frederickson","year":"1982","unstructured":"Frederickson, G.N., Ja\u2019ja, J.: On the relationship between the biconnectivity augmentation and travelling salesman problems. Theor. Comput. Sci. 19(2), 189\u2013201 (1982)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"GN Frederickson","year":"1981","unstructured":"Frederickson, G.N., Ja\u2019Ja\u2019, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270\u2013283 (1981)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Ameli, A.J., Traub, V.: Breaching the 2-approximation barrier for the forest augmentation problem. arXiv preprint arXiv:2112.11799 (2021)","DOI":"10.1145\/3519935.3520035"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Grandoni, F., Kalaitzis, C., Zenklusen, R.: Improved approximation for tree augmentation: saving by rewiring. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 632\u2013645 (2018)","DOI":"10.1145\/3188745.3188898"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Hunkenschr\u00f6der, C., Vempala, S., Vetta, A.: A 4\/3-approximation algorithm for the minimum 2-edge connected subgraph problem. ACM Trans. Algorithms 15(4) (2019). https:\/\/doi.org\/10.1145\/3341599","DOI":"10.1145\/3341599"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S Khuller","year":"1993","unstructured":"Khuller, S., Thurimella, R.: Approximation algorithms for graph augmentation. J. Algorithms 14(2), 214\u2013225 (1993)","journal-title":"J. Algorithms"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM 41(2), 214\u2013235 (1994). https:\/\/doi.org\/10.1145\/174652.174654","journal-title":"J. ACM"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Kortsarz, G., Nutov, Z.: A simplified 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2. ACM Trans. Algorithms (TALG) 12(2), 1\u201320 (2015)","DOI":"10.1145\/2786981"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.dam.2017.12.033","volume":"239","author":"G Kortsarz","year":"2018","unstructured":"Kortsarz, G., Nutov, Z.: LP-relaxations for tree augmentation. Discret. Appl. Math. 239, 94\u2013105 (2018)","journal-title":"Discret. Appl. Math."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization, vol. 46. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511977152"},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2739008","volume":"63","author":"T M\u00f6mke","year":"2016","unstructured":"M\u00f6mke, T., Svensson, O.: Removing and adding edges for the traveling salesman problem. J. ACM (JACM) 63(1), 1\u201328 (2016)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(02)00218-4","volume":"126","author":"H Nagamochi","year":"2003","unstructured":"Nagamochi, H.: An approximation for finding a smallest 2-edge-connected subgraph containing a specified spanning tree. Discret. Appl. Math. 126(1), 83\u2013113 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/s00453-020-00765-9","volume":"83","author":"Z Nutov","year":"2021","unstructured":"Nutov, Z.: On the tree augmentation problem. Algorithmica 83(2), 553\u2013575 (2021)","journal-title":"Algorithmica"},{"issue":"5","key":"5_CR28","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00493-014-2960-3","volume":"34","author":"A Seb\u00f6","year":"2014","unstructured":"Seb\u00f6, A., Vygen, J.: Shorter tours by nicer ears: 7\/5-approximation for the graph-TSP, 3\/2 for the path version, and 4\/3 for two-edge-connected subgraphs. Combinatorica 34(5), 597\u2013629 (2014). https:\/\/doi.org\/10.1007\/s00493-014-2960-3","journal-title":"Combinatorica"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Traub, V., Zenklusen, R.: A better-than-2 approximation for weighted tree augmentation. Corr abs\/2104.07114 (2021). Proceedings of the 62nd IEEE FOCS (2021)","DOI":"10.1109\/FOCS52979.2021.00010"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Traub, V., Zenklusen, R.: Local search for weighted tree augmentation and Steiner tree. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3253\u20133272. SIAM (2022)","DOI":"10.1137\/1.9781611977073.128"},{"key":"5_CR31","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06901-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T11:45:26Z","timestamp":1675683926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/home","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":"93","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":"35% - 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":"33","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)"}}]}}