Survey: A survey on the structure of approximation classes

Authors:
Bruno Escoffier;Vangelis Th. Paschos
Affiliations:
LAMSADE, CNRS and Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75775 Paris Cedex 16, France;LAMSADE, CNRS and Université Paris-Dauphine, Place du Maréchal De Lattre de Tassigny, 75775 Paris Cedex 16, France
Venue:
Computer Science Review
Year:
2010

Citing 41
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Checking computations in polylogarithmic time

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Completeness in approximation classes

Information and Computation
On the complexity of approximating the independent set problem

Information and Computation
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Logical definability of NP optimization problems

Information and Computation
Approximation properties of NP minimization classes

Journal of Computer and System Sciences
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
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
Hardness of approximations

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
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

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)
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
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
On Syntactic versus Computational Views of Approximability

SIAM Journal on Computing
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Max NP-completeness made easy

Theoretical Computer Science
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
P-Complete Approximation Problems

Journal of the ACM (JACM)
Structure in Approximation Classes

SIAM Journal on Computing
Approximation algorithms

Approximation algorithms
Some optimal inapproximability results

Journal of the ACM (JACM)
z-Approximations

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomially bounded minimization problems that are hard to approximate

Nordic Journal of Computing
The Approximation of Maximum Subgraph Problems

ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Zero Knowledge and the Chromatic Number

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
A Short Guide To Approximation Preserving Reductions

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Polynomial approximation and graph-coloring

Computing
Graphs and Hypergraphs

Graphs and Hypergraphs
Completeness in approximation classes beyond APX

Theoretical Computer Science
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
The PCP theorem by gap amplification

Journal of the ACM (JACM)
Approximation algorithms for some vehicle routing problems

Discrete Applied Mathematics
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The structure of approximability classes by the introduction of approximation preserving reductions has been one of the main research programmes in theoretical computer science during the last thirty years. This paper surveys the main results achieved in this domain.