Search

Your search keyword '"Janka Chlebíková"' showing total 2 results
Start Over Author "Janka Chlebíková" Database Complementary Index
2 results on '"Janka Chlebíková"'

2. Approximation hardness of edge dominating set problems.

Author

Miroslav Chlebík and Janka Chlebíková

Abstract

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 "$${\frac{7}{6}}$$". The result extends with negligible loss to bounded degree graphs and to everywhere dense graphs. [ABSTRACT FROM AUTHOR]

Published
2006

Catalog

Books, media, physical & digital resources
See catalog results