Improved approximation algorithms for Max-2SAT with cardinality constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 187-198

  Bläser, Markus ^a   Manthey, Bodo ^a  

^a UNIVERSITY OF LÜBECK   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; CARDINALITY CONSTRAINTS; GREEDY ALGORITHMS; OPTIMIZATION PROBLEMS; RUNNING TIME;

ARTIFICIAL INTELLIGENCE; ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 84878640869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_17     Document Type: Conference Paper

References (10)

1. A. A. Ageev and M. I. Sviridenko. Approximation algorithms for maximum coverage and max cut with given sizes of parts. In Proc. of the 7th Int. Conf. on Integer Programming and Combinatorial Optimization (IPCO), volume 1620 of Lecture Notes in Comput. Sci., pages 17-30. Springer, 1999.
2. N. Alon, J. H. Spencer, and P. Erdös. The Probabilistic Method. John Wiley and Sons, 1992.
3. T. Asano and D. P. Williamson. Improved approximation algorithms for MAX SAT. J. Algorithms, 42(1):173-202, 2002.
4. G. P. Cornuéjols, M. L. Fisher, and G. L. Nemhauser. Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management Science, 23:789-810, 1977.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
6. U. Feige. A threshold of In n for approximating set cover. J. ACM, 45(4):634-652, 1998.
7. U. Feige and M. X. Goemans. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In Proc. of the 3rd Israel Symp. on the Theory of Comput. and Systems (ISTCS), pages 182-189, 1995.
8. M. X. Goemans and D. P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAMJ. Discrete Math., 7(4):656-666, 1994.
9. J. Håstad. Some optimal inapproximability results. J. ACM, 48(4):798-859, 2001.
10. M. I. Sviridenko. Best possible approximation algorithm for MAX SAT with cardinality constraint. Algorithmica, 30(3):398-405, 2001. (Pubitemid 33710524)