Advertisement

Maximum Satisfiability

  • Vijay V. Vazirani
Chapter
  • 1.5k Downloads

Abstract

The maximum satisfiability problem has been a classical problem in approximation algorithms. More recently, its study has led to crucial insights in the area of hardness of approximation (see Chapter 29). In this chapter, we will use LP-rounding, with randomization, to obtain a 3/4 factor approximation algorithm. We will derandomize this algorithm using the method of conditional expectation.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes

  1. 157.
    D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9: 256–278, 1974.MathSciNetCrossRefGoogle Scholar
  2. 270.
    M. Yannakakis. On the approximation of maximum satisfiability. Journal of Algorithms, 3: 475–502, 1994.MathSciNetCrossRefGoogle Scholar
  3. 110.
    M.X. Goemans and D.P. Williamson. New 4-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics, 7: 656–666, 1994.MathSciNetCrossRefGoogle Scholar
  4. 80.
    P. Erdös and J.L. Selfridge. On a combinatorial game. Journal of Combinatorial Theory, Series A, 14: 298–301, 1973.zbMATHGoogle Scholar
  5. 251.
    J. Spencer. Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, PA, 1987.zbMATHGoogle Scholar
  6. 233.
    P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences, 37: 130–143, 1988.MathSciNetCrossRefGoogle Scholar
  7. 7.
    N. Alon and J. Spencer. The Probabilistic Method. John Wiley & Sons, New York, NY, 2000.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations