Department of Computer Science
 
Chair V

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

11.10.2012

Improved Approximation Lower Bounds for Vertex Cover on Power Law Graphs
and Some Generalizations
Mikael Gast, Mathias Hauptmann and Marek Karpinski
[Download PostScript] [Download PDF]

We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those classes of graphs and could be also of independent interest.

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