The approximability of constraint satisfaction problems

SIAM Journal on Computing

Volumn 30, Issue 6, 2000, Pages 1863-1920

  Khanna, Sanjeev ^a   Sudan, Madhu ^b   Trevisan, Luca ^c   Williamson, David P ^d  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Approximation algorithms; Approximation classes; Approximation preserving reductions; Boolean constraint satisfaction problems; Complete problems; Hardness of approximation

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; OPTIMIZATION;

APPROXIMATION ALGORITHMS; APPROXIMATION CLASSES; APPROXIMATION HARDNESS; APPROXIMATION PRESERVING REDUCTIONS; BOOLEAN CONSTRAINT SATISFACTION PROBLEM; COMPLETE PROBLEMS;

POLYNOMIAL APPROXIMATION;

EID: 0035705867     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539799349948     Document Type: Article

References (45)

1. E. AMALDI AND V. KANN, The complexity and approximability of finding maximum feasible subsystems of linear relations, Theoret. Comput. Sei., 147 (1995), pp. 181-210.
2. S. ARORA, L. BABAI, J. STERN, AND Z. SWEEDYK, The hardness of approximate optima in lattices, codes, and systems of linear equations, J. Comput. System Sei., 54 (1997), pp. 317-331.
3. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
4. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122.
5. S. ARORA AND M. SUDAN, Improved low degree testing and its applications, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 485-495.
6. T. ASANO, T. ONO, AND T. HIRATA, Approximation algorithms for the maximum satisfiability problem, in SWAT '9G, Rolf G. Karlsson and Andrzej Lingas, eds., Lecture Notes in Comput. Sei. 1097, Springer-Verlag, Berlin, 1996, pp. 100-111.
7. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proceedings of the 25th Annual ACM Symposium on Theory of Computing, San Diego, 1993, pp. 294-304.
8. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and nonapproximabilityTowards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
9. R. BOPPANA AND M. HALDôRSSON, Approximating maximum independent sets by excluding subgraphs, BIT, 32 (1992), pp. 180-196.
10. D. P. BOVET AND P. CRESCENZI, Introduction to the Theory of Complexity, Prentice-Hall, New York, 1994.
11. N. CREIGNOU, A dichotomy theorem for maximum generalized satisfiability problems, J. Comput. System Sei., 51 (1995), pp. 511-522.
12. N. CREIGNOU AND M. HERMANN, Complexity of generalized satisfiability counting problems, Inform, and Comput., 125 (1996), pp. 1-12.
13. P. CRESCENZI, V. KANN, R. SILVESTRI, AND L. TREVISAN, Structure in approximation classes, SIAM J. Comput., 28 (1999), pp. 1759-1782.
14. P. CRESCENZI AND A. PANCONESI, Completeness in approximation classes, Inform, and Cornput., 93 (1991), pp. 241-262.
15. P. CRESCENZI, R. SILVESTRI, AND L. TREVISAN, To weight or not to weight: Where is the question?, in Proceedings of the 4th IEEE Israel Symposium on Theory of Computing and Systems, Jerusalem, 1996, pp. 68-77.
16. G. EVEN, J. NAOR, B. SCHIEBER, AND M. SUDAN, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), pp. 151-174.
17. T. FEDER AND M. Y. VARDI, The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory, SIAM J. Comput., 28 (1998), pp. 57-104.
18. U. FEIGE, S. GOLDWASSER, L. LovÄsz, S. SAFRA, AND M. SZEGEDY, Interactive proofs and the hardness of approximating cliques, J. ACM, 43 (1996), pp. 268-292.
19. M.R. GAREY AND D.S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
20. N. GARG, V. V. VAZIRANI, AND M. YANNAKAKIS, Approximate max-flow min-(multi)cut theorems and their applications, SIAM J. Comput., 25 (1996), pp. 235-251.
21. M. X. GOEMANS AND D. P. WlLLIAMSON, New -approximation algorithms for the maximum satisfiability problem, SIAM J. Discrete Math., 7 (1994), pp. 656-666.
22. M. GOEMANS AND D. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming, J. ACM, 42 (1995), pp. 1115-1145.
23. J. HASTAD, Clique is hard to approximate within n1~£, in Proceedinsg of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, IEEE, 1996, pp. 627636.
24. J. HASTAD, Some optimal inapproximability results, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 1-10.
25. D. S. HOCIIBAUM, N. MEGIDDO, J. NAOR, AND A. TAMIU, Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality, Math. Programming, 62 (1993), pp. 69-83.
26. H. B. HUNT III, M. V. MARATHE, AND R. E. STEARNS, Generalized CNF satisfiability problems and non-efficient approximability, in Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 356-366.
27. H. KARLOFF AND U. ZWICK, A 7/8-approximation algorithm for MAX 3SAT?, in Proceedings of the 38th Annual Symposium on Foundations of Computer Science, Miami Beach, FL, IEEE, 1997, pp. 406-415.
28. S. KHANNA AND R. MOTWANI, Towards a syntactic characterization of PTAS, in Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, Philadelphia, 1996, pp. 329-337.
29. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. VAZIRANI, On syntactic versus computational views of approximability, SIAM J. Comput., 28 (1998), pp. 164-191.
30. S. KHANNA, M. SUDAN, AND L. TREVISAN, Constraint satisfaction: The approximability of minimization problems, in Proceedings of the 12th Annual IEEE Conference on Computational Complexity, Ulm, Germany, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 282-296.
31. S. KHANNA, M. SUDAN, AND D. P. WILLIAMSON, A complete classification of the approximability of maximization problems derived from Boolean constraint satisfaction, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 11-20.
32. P. KLEIN, A. AGARWAL, R. RAVI, AND S. RAO, Approximation through multicommodity flow, in Proceedings of the 31st Annual Symposium on Foundations of Computer Science, Vol. II, St. Louis, MO, IEEE, 1990, pp. 726-737.
33. P. N. KLEIN, S. A'. PLOTKIN, S. RAO, AND E. TARDOS, Approximation algorithms for Steiner and directed multicuts, J. Algorithms, 22 (1997), pp. 241-269.
34. P. G. KOLAITIS AND M. N. THAKUR, Approximation properties of NP minimization classes, J. Comput. System Sei., 50 (1995), pp. 391-411.
35. R. LADNER, On the structure of polynomial time reducibility, J. ACM, 22 (1975), pp. 155-171.
36. C. LUND AND M. YANNAKAKIS, On the hardness of approximating minimization problems, J. ACM, 41 (1994), pp. 960-981.
37. C. LUND AND M. YANNAKAKIS, The approximation of maximum subgraph problems, in Automata, Languages and Programming, 20th International Colloquium, Svante Carlsson, Andrzej Lingas, and Rolf G. Karlsson, eds., Lecture Notes in Comput. Sei. 700, SpringerVerlag, Lund, Sweden, 1993, pp. 40-51.
38. R. PANIGRAHY AND S. VISHWANATHAN, An O(logn) approximation algorithm for the asymmetric p-ccnter problem, J. Algorithms, 27 (1998), pp. 259-268.
39. C. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation and complexity classes, J. Comput. System Sei., 43 (1991), pp. 425-440.
40. E. PETRANK, The hardness of approximation: Gap location, Comput. Complexity, 4 (1994), pp. 133-157.
41. R. RAZ AND S. SAFRA, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 475-484.
42. T. SCHAEFER, The complexity of satisfiability problems, in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, San Diego, 1978, pp. 216-226.
43. L. TREVISAN, G. B. SORKIN, M. SUDAN, AND D. P. WILLIAMSON, Gadgets, approximation, and linear programming, SIAM J. Comput., 29 (2000), pp. 2074-2097.
44. M. YANNAKAKIS, On the approximation of maximum satisfiability, J. Algorithms, 17 (1994), pp. 475-502.
45. D. ZUCKERMAN, On unapproximable versions of NP-complete problems, SIAM J. Comput., 25 (1996), pp. 1293-1304.