An approximation algorithm for MAX-2-SAT with cardinality constraint

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

Volumn 2832, Issue , 2003, Pages 301-312

  Hofmeister, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

BEST APPROXIMATIONS; CARDINALITY CONSTRAINTS; LINEAR PROGRAMS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RANDOMIZED ROUNDING; SAT PROBLEMS;

APPROXIMATION ALGORITHMS;

EID: 0142214932     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39658-1_29     Document Type: Article

References (12)

1. [AKK] S. Arora, D. R. Karger and M. Karpinski, Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems, J. Computer and System Sciences 58(1), 193-210, 1999.
2. [AS] A. A. Ageev and M. Sviridenko, Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts, Proc. of the Seventh Conference on Integer Programming and Combinatorial Optimization (IPCO), 17-30, 1999.
3. [AW] T. Asano and D. P. Williamson, Improved Approximation Algorithms for MAX SAT, J. Algorithms 42(1), 173-202, 2002.
4. [BM] M. Bläser and B. Manthey, Improved Approximation Algorithms for MAX-2SAT with Cardinality Constraints, Proc. of the Int. Symp. on Algorithms and Computation (ISAAC), 187-198, 2002.
5. [F] U. Feige, A Threshold of Inn for Approximating Set Cover, J. of the ACM 45(4), 634-652, 1998.
6. [FL] U. Feige and M. Langberg, Approximation Algorithms for Maximization Problems Arising in Graph Partitioning, J. Algorithms 41(2), 174-211, 2001.
7. [GW1] M. X. Goemans and D. P. Williamson, New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem, SI AM J. Discrete Mathematics, 7(4), 656-666, 1994.
8. [GW2] M. X. Goemans and D. P. Williamson, Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming, J. of the ACM 42(6), 1115-1145, 1995.
9. [H] J. Håstad, Some Optimal Inapproximability Results, J. of the ACM 48(4), 798-859, 2001.
10. [MR] R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
11. [S] M. Sviridenko, Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint, Algorithmica 30(3), 398-405, 2001.
12. [V] V. V. Vazirani, Approximation Algorithms, Springer, 2001.