File(s) not publicly available
Approximation hardness of minimum edge dominating set and minimum maximal matching
presentation
posted on 2023-06-07, 22:16 authored by Miroslav ChlebikMiroslav Chlebik, Janka Chlebíková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.
History
Publication status
- Published
ISSN
0302-9743Publisher
Springer Berlin / HeidelbergExternal DOI
Volume
LNCS 2Pages
10.0Presentation Type
- paper
Event name
14th Annual International Symposium on Algorithms and Computation, Algorithms and ComputationEvent location
KYOTO, JAPANEvent type
conferenceISBN
978-3-540-20695-8Department affiliated with
- Mathematics Publications
Notes
ALGORITHMS AND COMPUTATION, PROCEEDINGSFull text available
- No
Peer reviewed?
- Yes
Editors
T Ibaraki, H Ono, N KatohLegacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC