On the approximation of maximum satisfiability

Journal of Algorithms

Volumn 17, Issue 3, 1994, Pages 475-502

  Yannakakis, Mihalis ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001843554     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1994.1045     Document Type: Article

References (39)

1. S. Arora, C. Lund, R. Motwani, M Sudan, and M. Szegedy, Proof verification and hardness of approximation problems in "Proceedings 33rd IEEE Symposium on Foundations of Computer Science, 1992, " pp. 14-23.
2. G. Ausiello, A. Marchetti-Spaccamela, and M. Protasi, Toward a unified approach for the classification of NP-complete optimization problems, Theoret. Comput. Sci. 12, (1980), 83-96.
3. B. Berger and P. W. Shor, Approximation algorithms for the maximum acyclic subgraph problem, "Proceedings 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, " pp. 236-243.
4. P. Berman, G. Schnitger, On the complexity of approximating the independent set problem in "Proceedings, 6th Annual Symposium on Theoretical Aspects of Computer Science. 1989.".
5. M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Inform. Process. Lett. 32 (1989), 171-176.
6. A. Blum, T. Jiang, M. Li, J. Tromp, and M. Yannakakis, Linear approximation of shortest superstrings, " in Proceedings, 23rd Annual ACM Symposium on Theory of Computing, 1991" pp. 328-336.
7. E. Boros and P. L. Hammer, A Max-Flow Approach to Improved Roof Duality in Quadratic 0-1 Minimization, " Rutcor Research Report #15-89, 1989.
8. E. Boros, P. L. Hammer and X. Sun, Network flows and roof duality for quadratic 0-1 programming, ORSA/TIMS Meeting, 1991.
9. N. Christofides, Worst-case analysis of new heuristics for the traveling salesman problem, Technical Report, GS1A, Carnegie-Mellon, 1976.
10. S. A. Cook, The complexity of theorem proving procedures, in "Proceedings, 3rd Annual ACM Symposium on Theory of Computing, 1971, " pp. 151-158.
11. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. Seymour, and M. Yannakakis, The complexity of multiway cuts, "Proceedings, 24th Annual ACM Symposium on Theory of Computing, 1992.
12. C. S. Edwards, An improved lower bound for the number of edges in a largest bipartite subgraph, in "Recent Advances in Graph Theory, " pp. 176-181, Academic, Prague, 1975.
13. P. Erdos, On bipartite subgraphs of graphs. Math. Lapok. 18 (1967), 283-288.
14. P. Erdos, R. Faudree, J. Pach, and J. Spencer, How to make a graph bipartite, J. Combin. Theory Ser. B 45, (1988), 86-98.
15. R. Fagin, Generalized first-order spectra, and polynomial-time recognizable sets in "Complexity of Computations, " (R. Karp, Ed.), Amer. Math. Soc., Providence, 1974.
16. M. R. Garey and D. S. Johnson, "Computers and Intractability: A guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
17. N. Garg, V. V. Vazirani, and M. Yannakakis, Approximate max-flow min- (multi)cut theorems and their applications, in "Proceedings, 25th Annual ACM Symposium, on Theory of Computing, 1992" pp. 698-707.
18. M. X. Goemans and D. P. Williamson, A new 3/4 approximation algorithm for MAX SAT, in "Proceedings, 3rd Conference on Integer Programming and Combinatorial Optimization, 1993".
19. D. J. Haglin and S. M. Venkatesan, Approximation and intractability Results for the maximum cut problem and its variants, " IEEE Trans. Comput. 40, No. 1 (1991), 110-113.
20. P. L. Hammer, P. Hansen, and B. Simeone, Roof duality, complementation and persistency in quadratic 0-1 optimization, Math. Programming 28 (1984), 121-155.
21. P. Hansen and B. Jaumard, Algorithms for the maximum satisfiability problem, Computing 44 (1990), 279-303.
22. M. A. Huang and K. J. Lieberherr, Implications of forbidden structures for extremal algorithmic problems, Theoret. Comput. Sci. 40 (1985), 195-210.
23. D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974), 256-278.
24. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Inform. Process. Lett. 37 (1991), 27-35.
25. R. M. Karp, Reducibility among combinatorial problems, in "Complexity of Computer Computations, " (R. E. Miller and J. W. Thatcher, Eds.) pp. 85-103, Plenum Press (1972).
26. P. Klein, A. Agrawal, R. Ravi, and S. Rao, Approximation Through Multicom- modity Flow, in "Proceedings, 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, " pp. 726-737.
27. P. G. Kolaitis, and M. N. Thakur, Approximation properties of NP minimization classes, in "Proceedings, 6th Annual Conference on Structures in Computer Science, 1991, " pp. 353-366.
28. K. Lieberherr and E. Specker, Complexity of partial satisfaction, J. Assoc. Comput. Math. 28, No. 2 (1981), 411-421.
29. K. Lieberherr and E. Specker, "Complexity of Partial Satisfaction, II, " Technical Report 293, Dept. of EECS, Princeton University, 1982.
30. A. Panconesi and D. Ranjan, Quantifiers and approximation, in "Proceedings, 22nd ACM Symposium, Theory of Computing, 1990, pp. 446-456.
31. C. H. Papadimitriou and K. Steiglitz, "Combinatorial Optimization: Algorithm and Complexity, " Prentice-Hall, Englewood Cliffs, N.J. 1982.
32. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, in "Proceedings, 20th Annual ACM Symposium on Theory of Computing, 1988, " pp. 229-234.
33. C. H. Papadimitriou and M. Yannakakis, J. Comput. System Sci. 43 (1991), 425-450.
34. C. H. Papdimitriou and M. Yannakakis, The traveling salesman problem with distances one and two, Math. Oper. Res. 18 (1993), 1-11.
35. A. Paz and S. Morgan, Non deterministic polynomial optimization problems and their approximation, Theoret. Comput. Sci. 15 (1981), 251-277.
36. S. Poijak and D. Turzik, A polynomial algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem, Canad. Math. 34, No. 3 (1982), 519-524.
37. S. Sahni and T. Gonzalez, P-complete approximation problems, J. Assoc. Comput. Mach. (1976), 555-565.
38. E. Tardos, A strongly polynomial algorithm for solving combinatorial linear programs, Oper. Res., (1986), 250-256.
39. P. Vitanyi, How well can a graph be n-colored? Discrete Math. (1981).