Inapproximability of Dominating Set in Power Law Graphs
Computational Complexity
2012-12-17 v1 Discrete Mathematics
Data Structures and Algorithms
Combinatorics
Optimization and Control
Abstract
We give logarithmic lower bounds for the approximability of the Minimum Dominating Set problem in connected (alpha,beta)-Power Law Graphs. We give also a best up to now upper approximation bound on the problem for the case of the parameters beta>2. We develop also a new functional method for proving lower approximation bounds and display a sharp phase transition between approximability and inapproximability of the underlying problem. This method could also be of independent interest.
Keywords
Cite
@article{arxiv.1212.3517,
title = {Inapproximability of Dominating Set in Power Law Graphs},
author = {Mikael Gast and Mathias Hauptmann and Marek Karpinski},
journal= {arXiv preprint arXiv:1212.3517},
year = {2012}
}
Comments
23 pages, 4 figures