Adding cardinality constraints to integer programs with applications to maximum satisfiability

Information Processing Letters

Volumn 105, Issue 5, 2008, Pages 194-198

  Bläser, Markus ^a   Heynen, Thomas ^b   Manthey, Bodo ^a  

^a SAARLAND UNIVERSITY   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

Approximation algorithms; Cardinality constraints; Randomized algorithms; Satisfiability

Indexed keywords

APPROXIMATION THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING; RANDOM VARIABLES;

CARDINALITY CONSTRAINT; RANDOMIZED ALGORITHMS; SATISFIABILITY;

CONSTRAINED OPTIMIZATION;

EID: 37849041213     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.08.024     Document Type: Article

References (13)

1. Ageev A.A., and Sviridenko M.I. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization 8 3 (2004) 307-328
2. Asano T., and Williamson D.P. Improved approximation algorithms for MAX SAT. Journal of Algorithms 42 1 (2002) 173-202
3. Bläser M., and Manthey B. Improved approximation algorithms for Max-2SAT with cardinality constraint. In: Bose P., and Morin P. (Eds). Proc. of the 13th Ann. Int. Symp. on Algorithms and Computation (ISAAC). Lecture Notes in Computer Science vol. 2518 (2002), Springer 187-198
4. Even G., Goldreich O., Luby M., Nisan N., and Veličović B. Efficient approximation of product distributions. Random Structures and Algorithms 13 1 (1998) 1-16
5. Feige U. A threshold of ln n for approximating set cover. Journal of the ACM 45 4 (1998) 634-652
6. U. Feige, 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 Computing Systems (ISTCS), 1995, pp. 182-189
7. Goemans M.X., and Williamson D.P. New frac(3, 4)-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7 4 (1994) 656-666
8. Håstad J. Some optimal inapproximability results. Journal of the ACM 48 4 (2001) 798-859
9. Hofmeister T. An approximation algorithm for Max-2-SAT with cardinality constraint. In: Di Battista G., and Zwick U. (Eds). Proc. of the 11th Ann. European Symp. on Algorithms (ESA). Lecture Notes in Computer Science vol. 2832 (2003), Springer 301-312
10. Karloff H., and Zwick U. A 7/8-approximation algorithm for MAX 3SAT?. Proc. of the 38th Ann. IEEE Symp. on Foundations of Computer Science (FOCS) (1997), IEEE Computer Society 406-415
11. Matuura S., and Matsui T. New approximation algorithms for MAX 2SAT and MAX DICUT. Journal of the Operations Research Society of Japan 46 2 (2003) 178-188
12. Sviridenko M.I. Best possible approximation algorithm for MAX SAT with cardinality constraint. Algorithmica 30 3 (2001) 398-405
13. Vazirani V.V. Approximation Algorithms (2001), Springer