On syntactic versus computational views of approximability

SIAM Journal on Computing

Volumn 28, Issue 1, 1998, Pages 164-191

  Khanna, Sanjeev ^a,b   Motwani, Rajeev ^a   Sudan, Madhu ^c   Vazirani, Umesh ^d  

^a Stanford University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Complete problems; Computational classes; Computational complexity; Local search; Polynomial reductions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS;

APPROXIMATION ALGORITHMS; NONOBLIVIOUS LOCAL SEARCH; POLYNOMIAL REDUCTIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0032057911     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795286612     Document Type: Article

References (25)

1. P. ALIMONTI, New local search approximation techniques for maximum generalized satisfiability problems, in Proc. 2nd Italian Conference on Algorithms and Complexity, Springer-Verlag, Berlin, 1994, pp. 40-53.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, in Proc. 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 14-23.
3. G. AUSIELLO, P. CRESCENZI, AND M. PROTASI, Approximate solution of NP optimization problems, Theoret. Comput. Sci., 150 (1995), pp. 1-55.
4. G. AUSIELLO AND M. PROTASI, Local search, reducibility, and approximability of NP optimization problems, Inform. Process. Lett., 54 (1995), pp. 73-79.
5. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proc. 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 294-304.
6. P. BERMAN AND M. FURER, Approximating maximum independent set in bounded degree graphs, in Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1993, pp. 365-371.
7. D. P. BOVET AND P. CRESCENZI, Introduction to the Theory of Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1993.
8. P. CRESCENZI AND A. PANCONESI, Completeness in approximation classes, Inform, and Comput., 93 (1991), pp. 241-262.
9. P. CRESCENZI AND L. TREVISAN, On approximation scheme preserving reducibility and its applications, in Proc. 14th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 880, Springer-Verlag, New York, 1994, pp. 330-341.
10. R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, in Complexity of Computer Computations, Richard Karp. ed., AMS, Providence, RI, 1974.
11. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Approximating clique is almost NP-complete, in Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 2-12.
12. M. R. GAREY AND DAVID S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
13. M. X. GOEMANS AND D. P. WILLIAMSON, .878-approximation algorithms for MAX CUT and MAX 2SAT, in Proc. 26th ACM Symposium on Theory of Computing, 1994, pp. 422-431.
14. M. M. HALLDORSSON AND J. RADHAKRISHNAN, Improved approximations of independent sets in bounded-degree graphs, Nordic J. Comput., 1 (1994), pp. 475-492.
15. D. S. HOCHBAUM, Efficient bounds for the stable set, vertex cover, and set packing problems, Disc. Appl. Math., 6 (1982), pp. 243-254.
16. V. KANN, On the Approximability of NP-complete Optimization Problems, Ph.D. Thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden, 1992.
17. D. KARGER, R. MOTWANI, AND G. D. S. RAMKUMAR, On approximating the longest path in a graph, in Proc. 3rd Workshop on Algorithms and Data Structures, Springer-Verlag, Berlin, 1993, pp. 421-432.
18. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. V. VAZIRANI, On syntactic versus computational views of approximability, in Proc. 35th Annual IEEE Symposium on Foundations of Computer Science, 1994, pp. 819-830.
19. S. KHANNA, R. MOTWANI, AND S. VISHWANATHAN, Approximating MAX SNP problems via semi-definite programming, in preparation, 1996.
20. P. G. KOLAITIS AND M. N. THAKUR, Approximation properties of NP minimization classes, J. Comput. System Sci., 50 (1995), pp. 391-411.
21. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. Assoc. Comput. Mach., 41 (1994), pp. 960-981.
22. A. PANCONESI AND D. RANJAN, Quantifiers and approximation, Theoret. Comput. Sci., 107 (1993), pp. 145-163.
23. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43 (1991), pp. 425-440.
24. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, The traveling salesman problem with distances one and two, Math. Oper. Res., 18 (1993), pp. 1-11.
25. M. YANNAKAKIS, The analysis of local search problems and their heuristics, in Proc. 7th Annual Symposium on Theoretical Aspects of Computer Science, Springer-Verlag, Berlin, 1990, pp. 298-311.