Approximation hardness of edge dominating set problems

Miroslav Chlebík () and Janka Chlebíková ()
Additional contact information
Miroslav Chlebík: Max Planck Institute for Mathematics in the Sciences
Janka Chlebíková: Comenius University

Journal of Combinatorial Optimization, 2006, vol. 11, issue 3, No 2, 279-290

Abstract: 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.

Keywords: Minimum edge dominating set; Minimum maximal matching; Approximation lower bound; Bounded degree graphs; Everywhere dense graphs (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-006-7908-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:11:y:2006:i:3:d:10.1007_s10878-006-7908-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-006-7908-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().