Advertisement

Abstract

We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate different special cases of the problem, including those obtained by restricting the literals to be unnegated and/or all clauses to have size exactly k. Our results show that the 1-in-kSAT problem exhibits some rather peculiar phenomena in the realm of constraint satisfaction problems. Specifically, the problem becomes substantially easier to approximate with perfect completeness as well as when negations of literals are not allowed.

Keywords

Approximation Algorithm Polynomial Time Random Assignment Constraint Satisfaction Problem Boolean Variable 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCP’s and non-approximability – towards tight results. SIAM Journal on Computing 27(3), 804–915 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 861–870 (2000)Google Scholar
  3. 3.
    Clementi, P., Crescenzi, A., Monti, P.: On computing ad-hoc selective families. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, p. 211. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Demaine, E., Feige, U., Hajiaghayi, M., Salavatipour, M.: Combination can be hard: approximability of the unique coverage problem (April 2005) (manuscript)Google Scholar
  5. 5.
    Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45(4), 634–652 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Guruswami, V.: Query-efficient checking of proofs and improved PCP characterizations of NP. Master’s thesis, MIT (1999)Google Scholar
  7. 7.
    Guruswami, V., Hartline, J., Karlin, A., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) (January 2005)Google Scholar
  8. 8.
    Samorodnitsky, A., Trevisan, L.: A PCP characterization of NP with optimal amortized query complexity. In: Proceedings of the 32nd ACM Symposium on Theory of Computing (2000)Google Scholar
  9. 9.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing, pp. 216–226 (1978)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Venkatesan Guruswami
    • 1
  • Luca Trevisan
    • 2
  1. 1.Dept. of Computer Science & EngineeringUniversity of WashingtonSeattleUSA
  2. 2.Computer Science DivisionUniversity of California at BerkeleyBerkeleyUSA

Personalised recommendations