Skip to main content
Springer Nature Link
Log in

Approximability of the Maximum Solution Problem for Certain Families of Algebras

  • Conference paper
Computer Science - Theory and Applications (CSR 2009)

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

Included in the following conference series:

Abstract

We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interesting problems in, for example, integer programming, equation solving, and graph theory. The approximability of this problem has previously been studied in the two-element case [Khanna et al, ‘The approximability of constraint satisfaction’, SIAM Journal on Computing 23(6), 2000] and in some algebraically motivated cases [Jonsson et al, ‘Max Ones generalized to larger domains’, SIAM Journal on Computing 38(1), 2008]. We continue this line of research by considering the approximability of Max Sol for different types of constraints. Our investigation combined with the older results strengthens the hypothesis that Max Sol exhibits a pentachotomy with respect to approximability.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the computational complexity of constraints using finte algebras. SIAM Journal on Computing 34(3), 720–742 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Goldman, J., Rota, G.-C.: On the foundations of combinatorial theory IV. Finite vector spaces and Eulerian generating functions. Studies in Appl. Math. 49, 239–258 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  5. Jeavons, P.: On the algebraic structure of combinatorial problems. Theoretical Computer Science 200(1-2), 185–204 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44(4), 527–548 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jonsson, P., Kuivinen, F., Nordh, G.: Max Ones generalized to larger domains. SIAM Journal on Computing 38(1), 329–365 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jonsson, P., Nordh, G.: Generalised integer programming based on logically defined relations. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 549–560. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Jonsson, P., Nordh, G., Thapper, J.: The maximum solution problem on graphs. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 228–239. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Khanna, S., Sudan, M., Trevisan, L., Williamson, D.P.: The approximability of constraint satisfaction problems. SIAM Journal on Computing 30(6), 1863–1920 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kuivinen, F.: Tight approximability results for the maximum solution equation problem over Z p . In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 628–639. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Pöschel, R., Kalužnin, L.: Funktionen- und Relationenalgebren. DVW, Berlin (1979)

    Book  Google Scholar 

  13. Post, E.: The two-valued iterative systems of mathematical logic. Annals of Mathematical Studies 5, 1–122 (1941)

    MathSciNet  Google Scholar 

  14. Szendrei, Á.: Clones in Universal Algebra. Seminaires de Mathématiques Supérieures, vol. 99. University of Montreal (1986)

    Google Scholar 

  15. Szendrei, Á.: Symmetric algebras. In: Contributions to General Algebra 6, pp. 259–280. Verlag Hölder-Pichler-Tempsky, Wien and Verlag Teubner, Stuttgart (1989)

    Google Scholar 

  16. Szendrei, Á.: Simple surjective algebras having no proper subalgebras. J. Austral. Math. Soc. ser. A 48, 434–454 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, Linköpings universitet, SE-581 83, Linköping, Sweden

    Peter Jonsson & Johan Thapper

Authors
  1. Peter Jonsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johan Thapper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics SB RAS, 4 Koptyug av, 630090, Novosibirsk, Russia

    Anna Frid

  2. Sobolev Institute of Mathematics SB RAS, Koptyug av. 4, 630090, Novosibirsk, Russia

    Andrey Morozov

  3. Max Planck Institute for Software Systems, Campus E1 4, 66123, Saarbrücken, Germany

    Andrey Rybalchenko

  4. Lehrstuhl für Theoretische Informatik, Institut für Informatik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97974, Würzburg, Germany

    Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jonsson, P., Thapper, J. (2009). Approximability of the Maximum Solution Problem for Certain Families of Algebras. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds) Computer Science - Theory and Applications. CSR 2009. Lecture Notes in Computer Science, vol 5675. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03351-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03351-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03350-6

  • Online ISBN: 978-3-642-03351-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation