Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-APX-Reports 2012 Copyright 2012 University of Bonn, Department of Computer Science, Abt. V
89142

17.12.2012

Inapproximability of Dominating Set in Power Law Graphs
Mikael Gast, Mathias Hauptmann and Marek Karpinski
[Download PostScript] [Download PDF]

We give logarithmic lower bounds for the approximability of the Minimum Dominating Set problem in connected (α,β)-Power Law Graphs. We give also a best up to now upper approximation bound on the problem for the case of the parameters β > 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.

Last Change: 11/05/14 at 10:58:28
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V