Max NP-completeness made easy

Theoretical Computer Science

Volumn 225, Issue 1-2, 1999, Pages 65-79

  Crescenzi, Pierluigi ^a   Trevisan, Luca ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation algorithms; Approximation preserving reductions; Class Max NP; Probabilistic method

Indexed keywords

EID: 0343670863     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00200-X     Document Type: Review

References (33)

1. G. Ausiello, A. D'Atri, M. Protasi, Structure preserving reductions among convex optimization problems, J. Comput. System Sci. 21 (1980) 136-153.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1992, pp. 14-23.
3. N. Alon, J. Spencer, The Probabilistic Method, Wiley Interscience, New York, 1992.
4. S. Arora, S. Safra, Probabilistic checking of proofs: a new characterization of NP, J. ACM 45 (1998) 70-122.
5. J.L. Balcázar, J. Díaz, J. Gabarró, Struct. Complexity I, Springer, Berlin, 1988.
6. B. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994) 153-180.
7. D.P. Bovet, P. Crescenzi, Introduction to the Theory of Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1993.
8. M. Bellare, O. Goldreich, M. Sudan, Free bits, PCP's and non-approximability - towards tight results, Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 422-431.
9. H.L. Bodlaender, Some classes of graphs with bounded treewidth, Bull. EATCS 36 (1988) 116-126.
10. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, Proc. 25th ACM Symp. on Theory of Computing, 1993, 226-234.
11. P. Crescenzi, A short guide to approximation preserving reductions, Proc. 12th Annual IEEE Conf. on Computational Complexity, 1997, pp. 262-273.
12. P. Crescenzi, V. Kann, R. Silvestri, L. Trevisan, Structure in approximation classes, Proc. 1st Combinatorics and Computing Conf. Lecture Notes in Computer Science, vol. 959, Springer, Berlin, 1995, pp. 539-548.
13. P. Crescenzi, A. Panconesi, Completeness in approximation classes, Inform. Comput. 93 (1991) 241-262.
14. P. Crescenzi, L. Trevisan, On approximation scheme preserving reducibility and its applications, Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 880, Springer, Berlin, 1994, pp. 330-341.
15. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, SIAM-AMS Proc. (1974) 43-73.
16. M.R. Garey, D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
17. M. Goemans, D. Williamson, New 3/4-approximation algorithms for the maximum satisfiability problem, SIAM J. Discrete Math. 7 (1994) 656-666.
18. J. Håstad, Some optimal inapproximability results, Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 1-10.
19. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz, R.E. Stearns, Approximation schemes using L-reductions, Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 880, Springer, Berlin, 1994, pp. 342-353.
20. D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256-278.
21. S. Khanna, personal communication, 1996.
22. S. Khanna, R. Motwani, Towards a syntactic characterization of PTAS, Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 329-337.
23. S. Khanna, R. Motwani, M. Sudan, U. Vazirani, On syntactic versus computational views of approximability, Proc. 35th IEEE Symp. on Foundations of Computer Science, 1994, pp. 819-830.
24. P.G. Kolaitis, M.N. Thakur, Logical definability of NP optimization problems, Inform. Comput. 115 (1994) 321-353.
25. P.G. Kolaitis, M.N. Thakur, Approximation properties of NP minimization classes, J. Comput. System Sci. 50 (1995) 391-411.
26. P. Orponen, H. Mannila, On approximation preserving reductions: complete problems and robust measures, Technical Report C-1987-28, Department of Computer Science, University of Helsinki, 1987.
27. C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
28. A. Paz, S. Moran, Non deterministic polynomial optimization problems and their approximation, Theoret. Comput. Sci. 15 (1981) 251-277.
29. A. Panconesi, D. Ranjan, Quantifiers and approximations, Theoret. Comput. Sci. 107 (1993) 145-163.
30. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
31. H.U. Simon, Continous reductions among combinatorial optimization problems, Acta Informatica 26 (1989) 771-785.
32. L. Trevisan, G.B. Sorkin, M. Sudan, D.P. Williamson, Gadgets, approximation, and linear programming, Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996, pp. 617-626.
33. M. Yannakakis, On the approximation of maximum satisfiability, J. Algorithms 17 (1994) 475-502.