Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching [chapter]

Miroslav Chlebík, Janka Chlebíková
2003 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-540-24587-2_43 fatcat:5hnr62moxfenrcyv7f5fpfta5e