by Sanjeev Khanna, Rajeev Motwani
In Proceedings of the 28th ACM Symposium on Theory of Computing
http://www.cis.upenn.edu/~cisfac/sanjeev/postscript/stoc96_ptas.ps.gz
Add To MetaCart
Abstract:
The class PTAS is defined to consist of all NP optimization problems that permit polynomial-time approximation schemes. This paper explores the possibility that a core of PTAS may be characterized through syntactic classes endowed with restrictions on the structure of the input instances. Recent work in approximability of NP-hard problems has led to the identification of a syntactic class called MAX SNP as the core of APX, the class of constant-factor approximable NP optimization problems. This has enhanced our understanding of these classes from both an algorithmic and a complexity-theoretic point of view. Our work is motivated by the hope that a similar understanding can be attained for PTAS. We argue that while the core of APX is the purely syntactic
Citations
|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
515
|
Proof verification and hardness of approximation problems
– Arora, Lund, et al.
- 1992
|
|
503
|
Optimization, approximation, and complexity classes
– Papadimitriou, Yannakakis
- 1991
|
|
288
|
A separator theorem for planar graphs
– Lipton, Tarjan
- 1979
|
|
242
|
Generalized first-order spectra and polynomial-time recognizable sets
– Fagin
- 1974
|
|
239
|
Bounds for certain multiprocessing anomalies
– Graham
- 1966
|
|
230
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
174
|
A linear time algorithm for finding tree-decompositions of small treewidth
– Bodlaender
- 1996
|
|
155
|
Polynomial time approximation schemes for dense instances of NP-hard problems
– Arora, Karger, et al.
- 1999
|
|
122
|
A planar separator theorem
– Lipton, Tarjan
- 1979
|
|
118
|
Planar formulae and their uses
– Lichtenstein
- 1982
|
|
97
|
On syntactic versus computational views of approximability
– Khanna, Motwani, et al.
- 1998
|
|
93
|
An efficient approximation scheme for the onedimensional bin-packing problem
– Karp, Karmarkar
- 1982
|
|
87
|
Introduction to the Theory of Complexity
– Bovet, Crescenzi
- 1994
|
|
53
|
Approximate algorithms for the 0-1 knapsack problem
– Sahni
- 1975
|
|
47
|
Quantifiers and Approximation
– Panconesi, Ranjan
- 1993
|
|
45
|
Approximation properties of NP minimization classes
– Kolaitis, Thakur
- 1995
|
|
40
|
Classes of graphs with bounded treewidth
– Bodlaender
- 1988
|
|
38
|
An approximation scheme for planar graph TSP
– Grigni, Koutsoupias, et al.
- 1995
|
|
18
|
Lecture notes on approximation algorithms
– Motwani
- 1992
|
|
17
|
de la Vega and
– Fernandez
- 1981
|
|
15
|
Finding separator cuts in planar graphs within twice the optimal
– Garg, Saran, et al.
- 1994
|
|
7
|
Designing Approximation Schemes Using L-Reductions
– Marathe, Radhakrishnan, et al.
- 1994
|
|
7
|
Algorithmic aspects of tree-width
– Minors
- 1986
|
|
2
|
Applications of the Planar Separator Theorem
– Chiba, Nishizeki, et al.
- 1981
|
