Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms

Authors:
Nicolas Bourgeois;Bruno Escoffier;Vangelis 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:
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Year:
2009

Citing 15
Cited 7

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
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)
Approximation algorithms

Approximation 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
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
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
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

Exact and approximate bandwidth

Theoretical Computer Science
Capacitated domination faster than O(2n)

Information Processing Letters
Fast algorithms for min independent dominating set

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Parameterized approximation algorithms for hitting set

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Parameterized approximation via fidelity preserving transformations

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
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
Moderately exponential approximation for makespan minimization on related machines

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 max independent set , min vertex cover and min set cover and then extend our results to max clique , max bipartite subgraph and max set packing .