Efficient approximation of MIN SET COVER by moderately exponential algorithms
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. (C) 2009 Elsevier B.V. All rights reserved.
min set cover exponential algorithms approximation algorithms