Skip to main content
SpringerLink
Log in

Sherali-Adams Relaxations for Valued CSPs

  • Conference paper
  • First Online:
Automata, Languages, and Programming (ICALP 2015)

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

Included in the following conference series:

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barto, L.: The collapse of the bounded width hierarchy. Journal of Logic and Computation (2014)

    Google Scholar 

  2. Barto, L., Kozik, M.: Robust Satisfiability of Constraint Satisfaction Problems. In: Proc. STOC 2012, pp. 931–940. ACM (2012)

    Google Scholar 

  3. Barto, L., Kozik, M.: Constraint Satisfaction Problems Solvable by Local Consistency Methods. Journal of the ACM 61(1), Article No. 3 (2014)

    Google Scholar 

  4. Bulatov, A.: Combinatorial problems raised from 2-semilattices. Journal of Algebra 298, 321–339 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bulatov, A., Krokhin, A., Jeavons, P.: Classifying the Complexity of Constraints using Finite Algebras. SIAM Journal on Computing 34(3), 720–742 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Chekuri, C., Khanna, S., Naor, J., Zosin, L.: A linear programming formulation and approximation algorithms for the metric labeling problem. SIAM J. on Discrete Mathematics 18(3), 608–625 (2004)

    Article  MathSciNet  Google Scholar 

  7. Cohen, D.A., Cooper, M.C., Jeavons, P.G.: Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms. Theoretical Computer Science 401(1–3), 36–51 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cohen, D.A., Cooper, M.C., Jeavons, P.G., Krokhin, A.A.: The Complexity of Soft Constraint Satisfaction. Artif. Intell. 170, 983–1016 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Dalmau, V., Krokhin, A., Manokaran, R.: Towards a characterization of constant-factor approximable Min CSPs. In: Proc. SODA 2015 (2015)

    Google Scholar 

  10. Dalmau, V., Krokhin, A.A.: Robust Satisfiability for CSPs: Hardness and Algorithmic Results. ACM ToCT 5(4), Article No. 15 (2013)

    Google Scholar 

  11. de la Vega, W. F., Kenyon-Mathieu, C.: Linear programming relaxations of maxcut. In: Proc. SODA 2007, pp. 53–61. SIAM (2007)

    Google Scholar 

  12. Ene, A., Vondrák, J., Wu, Y.: Local distribution and the symmetry gap: Approximability of multiway partitioning problems. In: SODA 2013, pp. 306–325 (2013)

    Google Scholar 

  13. Feder, T., Vardi, M.Y.: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory. SIAM Journal on Computing 28(1), 57–104 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  14. Fulla, P., Živný, S.: A Galois Connection for Valued Constraint Lan-guages of Infinite Size. In: Proc. ICALP 2015. Springer (2015)

    Google Scholar 

  15. Huber, A., Krokhin, A., Powell, R.: Skew bisubmodularity and valued CSPs. SIAM Journal on Computing 43(3), 1064–1084 (2014)

    Article  MATH  MathSciNet  Google Scholar 

  16. Jeavons, P., Krokhin, A., Živný, S.: The complexity of valued constraint satisfaction. Bulletin of the EATCS 113, 21–55 (2014)

    Google Scholar 

  17. Kolmogorov, V., Thapper, J., ZŽivný, S.: The power of linear programming for general-valued CSPs. SIAM Journal on Computing 44(1), 1–36 (2015)

    Google Scholar 

  18. Kolmogorov, V., ZŽivný, S.: The complexity of conservative valued CSPs. Journal of the ACM 60(2), Article No. 10 (2013)

    Google Scholar 

  19. Kozik, M., Krokhin, A., Valeriote, M., Willard, R.: Characterizations of several Maltsev Conditions. Algebra Universalis (2014) (to appear)

    Google Scholar 

  20. Kun, G., O’Donnell, R., Tamaki, S., Yoshida, Y., Zhou, Y.: Linear programming, width-1 CSPs, and robust satisfaction. In: ITCS 2012, p. 484–495 (2012)

    Google Scholar 

  21. Larose, B., Zádori, L.: Bounded width problems and algebras. Algebra Universalis 56, 439–466 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  22. Kozik, M., Ochremiak, J.: Algebraic Properties of Valued Constraint Satisfaction Problem. In: Proc. ICALP 2015. Springer (2015)

    Google Scholar 

  23. Raghavendra, P.: Optimal algorithms and inapproximability results for every CSP? In: Proc. STOC 2008, pp. 245–254. ACM (2008)

    Google Scholar 

  24. Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM Journal of Discrete Mathematics 3(3), 411–430 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  25. Takhanov, R.: A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem. In: Proc. STACS 2010, pp. 657–668 (2010)

    Google Scholar 

  26. Thapper, J., ZŽivný, S.: The power of linear programming for valued CSPs. In: Proc. FOCS 2012, pp. 669–678. IEEE (2012)

    Google Scholar 

  27. Thapper, J., ZŽivný, S.: The complexity of finite-valued CSPs. In: Proc. STOC 2013, pp. 695–704. ACM (2013) (February 2015). Full version arXiv:1210.2977v3

  28. Thapper, J., ZŽivný, S.: Necessary Conditions on Tractability of Valued Constraint Languages. Technical report, February 2015. arXiv:1502.03482

  29. Uppman, H.: The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 804–815. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  30. Yoshida, Y., Zhou, Y.: Approximation schemes via Sherali-Adams hierarchy for dense constraint satisfaction problems and assignment problems. In: Proc. ITCS 2014, pp. 423–438. ACM (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris-Est, Marne-la-Vallée, France

    Johan Thapper

  2. Department of Computer Science, University of Oxford, Oxford, UK

    Stanislav Živný

Authors
  1. Johan Thapper
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stanislav Živný
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stanislav Živný .

Editor information

Editors and Affiliations

  1. Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  2. Kyoto University, Kyoto, Japan

    Kazuo Iwama

  3. The University of Tokyo, Tokyo, Japan

    Naoki Kobayashi

  4. Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Bettina Speckmann

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thapper, J., Živný, S. (2015). Sherali-Adams Relaxations for Valued CSPs. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_86

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47672-7_86

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47671-0

  • Online ISBN: 978-3-662-47672-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation