Approximation hardness of edge dominatin
β
Miroslav ChlebΓk; Janka ChlebΓkovΓ‘
π
Article
π
2006
π
Springer US
π
English
β 324 KB
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