We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, MINIMUM EDGE DOMINATING SET and MINIMUM MAXIMAL MATCHING. We show that it is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7/6. The result extends with negligible loss to bounded degree graphs and to everywhere dense graphs. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Chlebík, M., & Chlebíková, J. (2003). Approximation hardness of minimum edge dominating set and minimum maximal matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2906, 415–424. https://doi.org/10.1007/978-3-540-24587-2_43
Mendeley helps you to discover research relevant for your work.