{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:45:58Z","timestamp":1787507158474,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030581497","type":"print"},{"value":"9783030581503","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_44","type":"book-chapter","created":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T21:02:42Z","timestamp":1598475762000},"page":"542-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Approximating Maximum Acyclic Matchings by Greedy and Local Search\u00a0Strategies"],"prefix":"10.1007","author":[{"given":"Julien","family":"Baste","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maximilian","family":"F\u00fcrst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dieter","family":"Rautenbach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"key":"44_CR1","unstructured":"Baste, J., F\u00fcrst, M., Rautenbach, D.: Linear programming based approximation for unweighted induced matchings - breaking the $$\\varDelta $$ barrier. arXiv:1812.05930"},{"key":"44_CR2","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.dam.2018.01.002","volume":"239","author":"J Baste","year":"2018","unstructured":"Baste, J., Rautenbach, D.: Degenerate matchings and edge colorings. Discret. Appl. Math. 239, 38\u201344 (2018)","journal-title":"Discret. Appl. Math."},{"key":"44_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.disc.2004.07.022","volume":"299","author":"K Cameron","year":"2005","unstructured":"Cameron, K., Walker, T.: The graphs with maximum induced matching and maximum matching the same size. Discret. Math. 299, 49\u201355 (2005)","journal-title":"Discret. Math."},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Independent set, induced matching, and pricing: connections and tight (subexponential time) approximation hardnesses. In: Proceedings of the 54th Annual Symposium on Foundations of Computer Science, FOCS \u201913, pp. 370\u2013379 (2013)","DOI":"10.1109\/FOCS.2013.47"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jda.2004.05.001","volume":"3","author":"W Duckworth","year":"2005","unstructured":"Duckworth, W., Manlove, D.F., Zito, M.: On the approximability of the maximum induced matching problem. J. Discret. Algorithms 3, 79\u201391 (2005)","journal-title":"J. Discret. Algorithms"},{"key":"44_CR6","unstructured":"F\u00fcrst, M.: Restricted matchings, Ph.D. thesis, Ulm University (2019)"},{"key":"44_CR7","doi-asserted-by":"publisher","first-page":"2353","DOI":"10.1016\/j.disc.2018.05.010","volume":"341","author":"M F\u00fcrst","year":"2018","unstructured":"F\u00fcrst, M., Rautenbach, D.: A lower bound on the acyclic matching number of subcubic graphs. Discret. Math. 341, 2353\u20132358 (2018)","journal-title":"Discret. Math."},{"key":"44_CR8","doi-asserted-by":"publisher","unstructured":"F\u00fcrst, M., Rautenbach, D.: On some hard and some tractable cases of the maximum acyclic matching problem. Ann. Oper. Res. 291\u2013300 (2019). https:\/\/doi.org\/10.1007\/s10479-019-03311-1","DOI":"10.1007\/s10479-019-03311-1"},{"key":"44_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2018.02.006","volume":"720","author":"M F\u00fcrst","year":"2018","unstructured":"F\u00fcrst, M., Leichter, M., Rautenbach, D.: Locally searching for large induced matchings. Theor. Comput. Sci. 720, 64\u201372 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disc.2004.08.027","volume":"293","author":"W Goddard","year":"2005","unstructured":"Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R.: Generalized subgraph-restricted matchings in graphs. Discret. Math. 293, 129\u2013138 (2005)","journal-title":"Discret. Math."},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11671411_2","volume-title":"Approximation and Online Algorithms","author":"N Ahuja","year":"2006","unstructured":"Ahuja, N., Baltz, A., Doerr, B., P\u0159\u00edv\u011btiv\u00fd, A., Srivastav, A.: On the minimum load coloring problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 15\u201326. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11671411_2"},{"key":"44_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.disc.2013.10.009","volume":"315","author":"MA Henning","year":"2014","unstructured":"Henning, M.A., Rautenbach, D.: Induced matchings in subcubic graphs without short cycles. Discret. Math. 315, 165\u2013172 (2014)","journal-title":"Discret. Math."},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1137\/16M1058078","volume":"30","author":"F Joos","year":"2016","unstructured":"Joos, F.: Induced matchings in graphs of bounded degree. SIAM J. Discret. Math. 30, 1876\u20131882 (2016)","journal-title":"SIAM J. Discret. Math."},{"key":"44_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1137\/140986980","volume":"30","author":"F Joos","year":"2016","unstructured":"Joos, F.: Induced matchings in graphs of degree at most 4. SIAM J. Discret. Math. 30, 154\u2013165 (2016)","journal-title":"SIAM J. Discret. Math."},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/130944424","volume":"28","author":"F Joos","year":"2014","unstructured":"Joos, F., Rautenbach, D., Sasse, T.: Induced matchings in subcubic graphs. SIAM J. Discret. Math. 28, 468\u2013473 (2014)","journal-title":"SIAM J. Discret. Math."},{"key":"44_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00453-003-1035-4","volume":"37","author":"D Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Finding Maximum induced matchings in subclasses of claw-free and $$P_5$$-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica 37, 327\u2013346 (2003)","journal-title":"Algorithmica"},{"key":"44_CR17","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/j.dam.2018.01.009","volume":"243","author":"MC Lin","year":"2018","unstructured":"Lin, M.C., Mestre, J., Vasiliev, S.: Approximating weighted induced matchings. Discret. Appl. Math. 243, 304\u2013310 (2018)","journal-title":"Discret. Appl. Math."},{"key":"44_CR18","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1016\/j.disopt.2007.11.010","volume":"5","author":"Y Orlovich","year":"2008","unstructured":"Orlovich, Y., Finke, G., Gordon, V., Zverovich, I.: Approximability results for the maximum and minimum maximal induced matching problems. Discret. Optim. 5, 584\u2013593 (2008)","journal-title":"Discret. Optim."},{"key":"44_CR19","doi-asserted-by":"publisher","first-page":"1250050","DOI":"10.1142\/S1793830912500504","volume":"4","author":"BS Panda","year":"2012","unstructured":"Panda, B.S., Pradhan, D.: Acyclic matchings in subclasses of bipartite graphs. Discret. Math. Algorithms Appl. 4, 1250050 (2012)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"44_CR20","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.tcs.2015.08.002","volume":"602","author":"D Rautenbach","year":"2015","unstructured":"Rautenbach, D.: Two greedy consequences for maximum induced matchings. Theor. Comput. Sci. 602, 32\u201338 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"44_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0020-0190(82)90077-1","volume":"15","author":"LJ Stockmeyer","year":"1982","unstructured":"Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inf. Process. Lett. 15, 14\u201319 (1982)","journal-title":"Inf. Process. Lett."},{"key":"44_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/3-540-46784-X_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Zito","year":"1999","unstructured":"Zito, M.: Induced matchings in regular graphs and trees. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 89\u2013101. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46784-X_10"}],"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-030-58150-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T01:43:36Z","timestamp":1619228616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","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":"Atlanta, GA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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.7","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.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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}