Thumbnail

Efficient approximation of MIN SET COVER by moderately exponential algorithms

Paschos, Vangelis; Escoffier, Bruno; Bourgeois, Nicolas (2009), Efficient approximation of MIN SET COVER by moderately exponential algorithms, Theoretical Computer Science, 410, 21-23, p. 2184-2195. http://dx.doi.org/10.1016/j.tcs.2009.02.007

View/Open
Type
Article accepté pour publication ou publié
Date
2009
Journal name
Theoretical Computer Science
Volume
410
Number
21-23
Publisher
Elsevier
Pages
2184-2195
Publication identifier
Metadata
Show full item record
Author(s)
Paschos, Vangelis
Escoffier, Bruno
Bourgeois, Nicolas
Abstract (EN)
We study the approximation of min set cover combining ideas and results from polynomial approximation and from exact computation (with non-trivial worst case complexity upper bounds) for NP-hard problems. We design approximation algorithms for min set cover achieving ratios that cannot be achieved in polynomial time (unless problems in NP could be solved by slightly super-polynomial algorithms) with worst-case complexity much lower (though super-polynomial) than those of an exact computation.
Subjects / Keywords
Exponential algorithms; Approximation algorithms; Min set cover