Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Authors:
Nicolas Bourgeois;Bruno Escoffier;Vangelis Th. Paschos
Affiliations:
LAMSADE, CNRS and Université Paris-Dauphine, France;LAMSADE, CNRS and Université Paris-Dauphine, France;LAMSADE, CNRS and Université Paris-Dauphine, France and Institut Universitaire de France, France
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 22
Cited 6

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Vertex cover: further observations and further improvements

Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Confronting hardness using a hybrid approach

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Inclusion--Exclusion Algorithms for Counting Set Partitions

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Efficient approximation of min set cover by moderately exponential algorithms

Theoretical Computer Science
Exponential-time approximation of weighted set cover

Information Processing Letters
An O*(1.0977n) exact algorithm for MAX INDEPENDENT SET in sparse graphs

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact Exponential Algorithms

Exact Exponential Algorithms
Algorithmics in exponential time

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Fast Algorithms for max independent set

Algorithmica
A bottom-up method and fast algorithms for MAX INDEPENDENT SET

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
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

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
New results on polynomial inapproximability and fixed parameter approximability of edge dominating set

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Exponential approximation schemata for some network design problems

Journal of Discrete Algorithms
An exponential time 2-approximation algorithm for bandwidth

Theoretical Computer Science
A novel parameterised approximation algorithm for minimum vertex cover

Theoretical Computer Science

Quantified Score

Hi-index	0.05

Visualization

Abstract

Using ideas and results from polynomial time approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation. We study in particular two paradigmatic problems, max independent set and min vertex cover.