Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2005: Mathematical Foundations of Computer Science 2005 pp 603–614Cite as

An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems

  • Conference paper

  • 1342 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3618))

Abstract

An instance of a constraint satisfaction problem is l-consistent if any l constraints of it can be simultaneously satisfied. For a set Π of constraint types, ρ l (Π) denotes the largest ratio of constraints which can be satisfied in any l-consistent instance composed by constraints from the set Π. We study the asymptotic behavior of ρ l (Π) for sets Π consisting of Boolean predicates.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Spencer, J.: The probabilistic method, 2nd edn. John Wiley, New York (2000)

    Book  MATH  Google Scholar 

  2. Chazelle, B.: The discrepancy method: Randomness and complexity. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  3. Cook, S., Mitchell, D.: Finding Hard Instances of the Satisfiability Problem: A Survey. In: Satisfiability Problem: Theory and Applications. DIMACS Series in DMTCS, vol. 35, AMS (1997)

    Google Scholar 

  4. Dvořák, Z., Král, D., Pangrác, O.: Locally consistent constraint satisfaction problems. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 469–480. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Eppstein, D.: Improved Algorithms for 3-coloring, 3-edge-coloring and Constraint Satisfaction. In: Proc. of the 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 329–337. SIAM, Philadelphia (2001)

    Google Scholar 

  6. Feder, T., Motwani, R.: Worst-case Time Bounds for Coloring and Satisfiability Problems. J. Algorithms 45(2), 192–201 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Håstad, J.: Some optimal inapproximability results. Journal of ACM 48(4), 798–859 (2001); A preliminary version appeared. In: Proc. 28th ACM Symposium on Theory of Computing (STOC), pp. 1–10. ACM Press, New York (1997)

    Google Scholar 

  8. Huang, M.A., Lieberherr, K.: Implications of Forbidden Structures for Extremal Algorithmic Problems. Theoretical Computer Science 40, 195–210 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  9. Jukna, S.: Extremal Combinatorics with Applications in Computer Science. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  10. Král, D.: Locally Satisfiable Formulas. In: Proc. of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 323–332. SIAM, Philadelphia (2004)

    Google Scholar 

  11. Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction. J. of the ACM 28(2), 411–422 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lieberherr, K., Specker, E.: Complexity of Partial Satisfaction II. Technical Report 293, Dept. of EECS, Princeton University (1982)

    Google Scholar 

  13. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    MATH  Google Scholar 

  14. Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of the 10th Annual ACM Symposium on Theory of Computing (STOC), pp. 216–226. ACM Press, New York (1978)

    Chapter  Google Scholar 

  15. Trevisan, L.: On Local versus Global Satisfiability. SIAM J. Disc. Math. A preliminary version available as ECCC report TR97-12 (to appear)

    Google Scholar 

  16. Usiskin, Z.: Max-min Probabilities in the Voting Paradox. Ann. Math. Stat. 35, 857–862 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  17. Woeginger, G.J.: Exact Algorithms for NP-hard Problems: A Survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Yannakakis, M.: On the Approximation of Maximum Satisfiability. J. Algorithms 17, 475–502 (1994); A preliminary version appeared. In: Proc. of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1–9. SIAM, Philadelphia (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Mathematics, Technical University Berlin, Strasse des 17. Juni 136, D-10623, Berlin, Germany

    Daniel Král’

  2. Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Malostranské náměstí 25, 118 00, Prague, Czech Republic

    Daniel Král’ & Ondřej Pangrác

Authors
  1. Daniel Král’
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ondřej Pangrác
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Gdansk University, Wita Stwosza 57, 80 952, Gdansk, Poland

    Joanna Jȩdrzejowicz  & Andrzej Szepietowski  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Král’, D., Pangrác, O. (2005). An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_52

Download citation

  • DOI: https://doi.org/10.1007/11549345_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28702-5

  • Online ISBN: 978-3-540-31867-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation