Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems

Szymon Dudycz, Pasin Manurangsi, Jan Marcinkowski. Tight Inapproximability of Minimum Maximal Matching on Bipartite Graphs and Related Problems. In Jochen Könemann, Britta Peis, editors, Approximation and Online Algorithms - 19th International Workshop, WAOA 2021, Lisbon, Portugal, September 6-10, 2021, Revised Selected Papers. Volume 12982 of Lecture Notes in Computer Science, pages 48-64, Springer, 2021. [doi]

Abstract

Abstract is missing.