Efficient approximation of min set cover by moderately exponential algorithms

Authors:
N. Bourgeois;B. Escoffier;V. Th. Paschos
Affiliations:
LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, France;LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, France;LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, France
Venue:
Theoretical Computer Science
Year:
2009

Citing 21
Cited 11

A modified greedy heuristic for the set covering problem with improved worst case bound

Information Processing Letters
On an approximation measure founded on the links between optimization and polynomial approximation theory

Theoretical Computer Science
A tight analysis of the greedy algorithm for set cover

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation of k-set cover by semi-local optimization

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Differential approximation algorithms for some combinatorial optimization problems

Theoretical Computer Science
z-Approximations

Journal of Algorithms
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
3-coloring in time O(1.3289n)

Journal of Algorithms
Graphs and Hypergraphs

Graphs and Hypergraphs
Confronting hardness using a hybrid approach

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Completeness in standard and differential approximation classes: poly-(D)APX- and (D)PTAS-completeness

Theoretical Computer Science
On the differential approximation of MIN SET COVER

Theoretical Computer Science
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences
Algorithmics in exponential time

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Fixed-parameter approximation: conceptual framework and approximability results

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On parameterized approximability

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximation problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation

Approximation of min coloring by moderately exponential algorithms

Information Processing Letters
Exponential-time approximation of weighted set cover

Information Processing Letters
Collective spatial keyword querying

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Discrete Applied Mathematics
Approximating MAX SAT by moderately exponential and parameterized algorithms

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Algorithms for dominating clique problems

Theoretical Computer Science
Efficient algorithms for the max k-vertex cover problem

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Fast algorithms for min independent dominating set

Discrete Applied Mathematics
Exponential approximation schemata for some network design problems

Journal of Discrete Algorithms
Integrating domain heterogeneous data sources using decomposition aggregation queries

Information Systems
An exponential time 2-approximation algorithm for bandwidth

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.