Skip to main content
SpringerLink
Log in

Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12273))

Included in the following conference series:

Abstract

A matching M in a graph G is acyclic if the subgraph of G induced by the vertices that are incident to an edge in M is a forest. Even restricted to graphs of bounded maximum degree, the maximum acyclic matching problem is hard. We contribute efficient approximation algorithms for this problem, based on greedy and local search strategies, that have performance guarantees involving the maximum degree of the input graphs.

Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 388217545.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Baste, J., Fürst, M., Rautenbach, D.: Linear programming based approximation for unweighted induced matchings - breaking the \(\varDelta \) barrier. arXiv:1812.05930

  2. Baste, J., Rautenbach, D.: Degenerate matchings and edge colorings. Discret. Appl. Math. 239, 38–44 (2018)

    Article  MathSciNet  Google Scholar 

  3. Cameron, K., Walker, T.: The graphs with maximum induced matching and maximum matching the same size. Discret. Math. 299, 49–55 (2005)

    Article  MathSciNet  Google Scholar 

  4. 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 ’13, pp. 370–379 (2013)

    Google Scholar 

  5. Duckworth, W., Manlove, D.F., Zito, M.: On the approximability of the maximum induced matching problem. J. Discret. Algorithms 3, 79–91 (2005)

    Article  MathSciNet  Google Scholar 

  6. Fürst, M.: Restricted matchings, Ph.D. thesis, Ulm University (2019)

    Google Scholar 

  7. Fürst, M., Rautenbach, D.: A lower bound on the acyclic matching number of subcubic graphs. Discret. Math. 341, 2353–2358 (2018)

    Article  MathSciNet  Google Scholar 

  8. Fürst, M., Rautenbach, D.: On some hard and some tractable cases of the maximum acyclic matching problem. Ann. Oper. Res. 291–300 (2019). https://doi.org/10.1007/s10479-019-03311-1

  9. Fürst, M., Leichter, M., Rautenbach, D.: Locally searching for large induced matchings. Theor. Comput. Sci. 720, 64–72 (2018)

    Article  MathSciNet  Google Scholar 

  10. Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Laskar, R.: Generalized subgraph-restricted matchings in graphs. Discret. Math. 293, 129–138 (2005)

    Article  MathSciNet  Google Scholar 

  11. Ahuja, N., Baltz, A., Doerr, B., Přívětivý, A., Srivastav, A.: On the minimum load coloring problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 15–26. Springer, Heidelberg (2006). https://doi.org/10.1007/11671411_2

    Chapter  Google Scholar 

  12. Henning, M.A., Rautenbach, D.: Induced matchings in subcubic graphs without short cycles. Discret. Math. 315, 165–172 (2014)

    Article  MathSciNet  Google Scholar 

  13. Joos, F.: Induced matchings in graphs of bounded degree. SIAM J. Discret. Math. 30, 1876–1882 (2016)

    Article  MathSciNet  Google Scholar 

  14. Joos, F.: Induced matchings in graphs of degree at most 4. SIAM J. Discret. Math. 30, 154–165 (2016)

    Article  MathSciNet  Google Scholar 

  15. Joos, F., Rautenbach, D., Sasse, T.: Induced matchings in subcubic graphs. SIAM J. Discret. Math. 28, 468–473 (2014)

    Article  MathSciNet  Google Scholar 

  16. 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–346 (2003)

    Article  MathSciNet  Google Scholar 

  17. Lin, M.C., Mestre, J., Vasiliev, S.: Approximating weighted induced matchings. Discret. Appl. Math. 243, 304–310 (2018)

    Article  MathSciNet  Google Scholar 

  18. Orlovich, Y., Finke, G., Gordon, V., Zverovich, I.: Approximability results for the maximum and minimum maximal induced matching problems. Discret. Optim. 5, 584–593 (2008)

    Article  MathSciNet  Google Scholar 

  19. Panda, B.S., Pradhan, D.: Acyclic matchings in subclasses of bipartite graphs. Discret. Math. Algorithms Appl. 4, 1250050 (2012)

    Article  MathSciNet  Google Scholar 

  20. Rautenbach, D.: Two greedy consequences for maximum induced matchings. Theor. Comput. Sci. 602, 32–38 (2015)

    Article  MathSciNet  Google Scholar 

  21. Stockmeyer, L.J., Vazirani, V.V.: NP-completeness of some generalizations of the maximum matching problem. Inf. Process. Lett. 15, 14–19 (1982)

    Article  MathSciNet  Google Scholar 

  22. Zito, M.: Induced matchings in regular graphs and trees. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 89–101. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-46784-X_10

    Chapter  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Optimization and Operations Research, Ulm University, Ulm, Germany

    Julien Baste, Maximilian Fürst & Dieter Rautenbach

Authors
  1. Julien Baste
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maximilian Fürst
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dieter Rautenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dieter Rautenbach .

Editor information

Editors and Affiliations

  1. Georgia State University, Atlanta, USA

    Donghyun Kim

  2. Department of Mathematics and Physics, North Carolina Central University, Durham, NC, USA

    R. N. Uma

  3. Computer Science, Georgia State University, Atlanta, GA, USA

    Zhipeng Cai

  4. Korea University, Seoul, Korea (Republic of)

    Dong Hoon Lee

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Baste, J., Fürst, M., Rautenbach, D. (2020). Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies. In: Kim, D., Uma, R., Cai, Z., Lee, D. (eds) Computing and Combinatorics. COCOON 2020. Lecture Notes in Computer Science(), vol 12273. Springer, Cham. https://doi.org/10.1007/978-3-030-58150-3_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58150-3_44

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58149-7

  • Online ISBN: 978-3-030-58150-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation