Towards a syntactic characterization of PTAS

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 329-337

  Khanna, Sanjeev ^a   Motwani, Rajeev ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; ALGORITHMS; DATA STRUCTURES; EQUIVALENCE CLASSES; GRAPH THEORY; PROBLEM SOLVING;

CONSTANT FACTORS; NP OPTIMIZATION PROBLEMS; PLANAR STRUCTURE; POLYNOMIAL TIME APPROXIMATION SCHEMES; PROBLEM DEFINITION; STRUCTURAL RESTRICTIONS; SYNTACTIC CHARACTERIZATION; UNIFIED FRAMEWORK;

SYNTACTICS; COMPUTATIONAL COMPLEXITY;

SYNTACTIC CHARACTERIZATION; SYNTACTIC CLASSES;

EID: 0029712046     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237979     Document Type: Conference Paper

References (26)

1. S. Arora, D. Karger, and M. Karpinski. Polynomial Time Approximation Schemes for Dense Instances of NP-hard Problems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing (1995).
2. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Hardness of Approximation Problems. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science (1992), pp. 14-23.
3. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41:153-180 (1994).
4. H. L. Bodlaender. Some Classes of Graphs with Bounded Treewidth. Bulletin of the European Association for Theoretical Computer Science (1988), pp. 116-126.
5. H. L. Bodlaender. A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing (1993), pp. 226-234.
6. D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice-Hall, New York (1993).
7. N. Chiba, T. Nishizeki, and N. Saito. Applications of the Planar Separator Theorem. Journal of Information Processing, 4:203-207 (1981).
8. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In Richard Karp (ed.), Complexity of Computation, AMS (1974).
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979).
10. N. Garg, H. Saran, and V. Vazirani. Finding separator cuts in planar graphs within twice the optimal. In Proceedings of the 35th Annual ACM Symposium on Foundations of Computer Science (1994), pp. 14-23.
11. R. L. Graham. Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal, 45:1563-1581 (1966).
12. M. Grigni, E. Koustsoupias, and C. Papadimitriou. An Approximation Scheme for Planar Graph TSP. In Proceedings of the 36th Annual ACM Symposium on Foundations of Computer Science (1995), pp. 640-645.
13. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. Approximation Schemes using L-reductions. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science (1994), pp. 342-353.
14. N. Karmakar and R. M. Karp. An Efficient Approximation Scheme For The One-Dimensional Bin Packing Problem. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (1982), pp. 312-320.
15. S. Khanna, R. Motwani, M. Sudan, and U. V. Vazirani. On Syntactic versus Computational Views of Approximability. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (1994), pp. 819-830.
16. P. G. Kolaitis and M. N. Thakur. Approximation Properties of NP Minimization Classes. In Proceedings of the Sixth Annual Structure in Complexity Theory Conference (1991), pp. 353-366.
17. D. Lichtenstein. Planar Formulae and their Uses. SIAM Journal on Computing, 11:329-343 (1980).
18. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 36:177-189 (1979).
19. R. J. Lipton and R. E. Tarjan. Applications of Planar Separator Theorem. SIAM Journal on Computing, 9:615-627 (1980).
20. R. Motwani. Lecture Notes on Approximation Algorithms. Report No. STAN-CS-92-1435, Department of Computer Science, Stanford University (1992).
21. A. Panconesi and D. Ranjan. Quantifiers and Approximation. In Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing (1990), pp. 446-456.
22. C. H. Papadimitriou. Computational Complexity. Addison-Wesley (1994).
23. C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences, 43:425-440 (1991).
24. N. Robertson and P. D. Seymour. Graph Minors. II. Algorithmic Aspects of Treewidth. Journal of Algorithms, 7:309-322 (1986).
25. S. Sahni. Approximate algorithms for the 0/1 knapsack problem. Journal of the ACM, 22:115-124 (1975).
26. W. Fernandez de la Vega and G. S. Lueker. Bin Packing can be solved within 1 + e in Linear Time, Combinatorica, 1:349-355 (1981).