Rheinische Friedrich-Wilhelms-Universität Bonn Institut für Informatik
Abteilung V

Universität Bonn -> Institut für Informatik -> Abteilung V
CS-APX-Reports 2010 Copyright 2010 Universität Bonn, Institut für Informatik, Abt. V


Approximating Subdense Instances of Covering Problems
Jean Cardinal, Marek Karpinski, Richard Schmied and Claus Viehmann
[Download PostScript] [Download PDF]

We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Ω(n/ψ(n)) for some function ψ(n) =ω(1) of the instance size. We design new approximation algorithms as well as new polynomial time approximation schemes (PTASs) for those problems and establish first approximation hardness results for them. Interestingly, in some cases we were able to prove optimality of the underlying approximation ratios, under usual complexity-theoretic assumptions. Our results for the Vertex Cover problem depend on an improved recursive sampling method which could be of independent interest.

Last Change: 11/05/14 at 10:52:50
Universität Bonn -> Institut für Informatik -> Abteilung V

Powered by Zope