Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights

Theoretical Computer Science

Volumn 244, Issue 1-2, 2000, Pages 189-203

  Jonsson, Peter ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Boolean constraints; Computational complexity; Optimization problems

Indexed keywords

EID: 0346076847     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00343-0     Document Type: Article

References (16)

1. N. Creignou, A dichotomy theorem for maximum generalized satisfiability problems, J. Comput. System Sci. 51 (3) (1995) 511-522.
2. N. Creignou, M. Hermann, Complexity of generalized satisfiability counting problems, Inform. and Comput. 125 (1996) 1-12.
3. S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Theoret. Comput. Sci. 10 (2) (1980) 111-121.
4. D. Gusfield, L. Pitt, A bounded approximation for the minimum cost 2-Sat problem, Algorithmica 8 (1992) 103-117.
5. P. Hell, N. Nešetřil, On the complexity of H-coloring, J. Combin. Theory, Ser. B 48 (1990) 92-110.
6. I. Heller, C.B. Tompkins, An extension of a theorem of Dantzig, in: H.W. Kuhn, A.W. Tucker (Eds.), Linear Inequalities and Related Systems, Princeton University Press, New York, 1956, pp. 247-252.
7. D. Hochbaum, N. Megiddo, J. Naor, A. Tamir, Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality, Math. Programming 62 (1993) 69-84.
8. A.J. Hoffman, J.B. Kruskal, Integral boundary points of convex polyhedra, in: H.W. Kuhn, A.W. Tucker (Eds.), Linear Inequalities and Related Systems, Princeton University Press, New York, 1956, pp. 223-246.
9. V. Kann, On the approximability of NP-complete optimization problems, Ph.D. Thesis, Royal Institute of Technology, Stockholm, 1992.
10. V. Kann, Polynomially bounded minimization problems that are hard to approximate, Nordic J. Comput. 1 (1994) 317-331.
11. L.G. Khachiyan, A polynomial algorithm in linear programming, Sov. Math. Dokl. 20 (1979) 191-194.
12. S. Khanna, M. Sudan, L. Trevisan, Constraint satisfaction: the approximability of minimization problems, in: Proc. 12th Annu. IEEE Conf. on Computational Complexity, 1997, pp. 282-296.
13. S. Khanna, M. Sudan, D.P. Williamson, A complete classification of the approximability of maximization problems derived from boolean constraint satisfaction, in: Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 11-20.
14. C.H. Papadimitriou, K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.
15. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. of the 10th ACM Symp. on Theory of Computing, 1978, pp. 216-226.
16. A. Schrijver, Theory of Linear and Integer Programming, Wiley, New York, 1986.