File(s) not publicly available
Approximation hardness of dominating set problems in bounded degree graphs
journal contribution
posted on 2023-06-08, 05:39 authored by Miroslav ChlebikMiroslav Chlebik, J ChlebíkováWe study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various kinds of domination problems (connected, total, independent) in bounded degree graphs. Asymptotically, for degree bound approaching infinity, these bounds almost match the known upper bounds. The results are applied to improve the lower bounds for other related problems such as Maximum Induced Matching and Maximum Leaf Spanning Tree.
History
Publication status
- Published
Journal
Information and ComputationISSN
0890-5401External DOI
Issue
11Volume
206Page range
1264-1275Pages
12.0Department affiliated with
- Mathematics Publications
Full text available
- No
Peer reviewed?
- Yes
Legacy Posted Date
2012-02-06Usage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC