Skip to main content
SpringerLink
Log in

Approximation of Constraint Satisfaction via local search

Extended abstract

  • Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 955))

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Edoardo Amaldi and Viggo Kann. On the approximability of finding maximum feasible subsystems of linear systems. In Proc. STACS 94, pp. 521–532, 1994.

    Google Scholar 

  2. P. Berman and G. Schnitger. On the complexity of approximating the independent set problem. Infor. & Comput., Vol. 96, pp. 77–94, 1992.

    Google Scholar 

  3. R. L. Brooks. On colouring the nodes of a network. In Proc. Cambridge Philos. Soc., Vol. 37, pp. 194–197, 1941.

    Google Scholar 

  4. Paul Catlin. A bound on the chromatic number of a graph. Discrete Math., Vol. 22, pp. 81–83, 1978.

    Article  Google Scholar 

  5. Rina Dechter and Judea Pearl. Network-based heuristics for constraint satisfaction. Artif. Int., Vol. 34, pp. 1–38, 1988.

    Article  Google Scholar 

  6. Michel X. Goemans and David P. Williamson. Approximation algorithms for MAX CUT and MAX 2SAT. In Proc. STOC 94, pp. 422–431, 1994.

    Google Scholar 

  7. Magnús M. Halldórsson. 1994. Personal communication.

    Google Scholar 

  8. Magnús M. Halldórsson. Approximating discrete collections via local improvements. In Proc. SODA 95, pp. 601–610, San Francisco, California, January 1995.

    Google Scholar 

  9. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proc. FOCS 94, 1994.

    Google Scholar 

  10. L. Lovász. On decomposition of graphs. Studia Sci. Math. Hungar., Vol. 1, pp. 237–238, 1966.

    Google Scholar 

  11. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. J. Comput. Sys. Sci., Vol. 43, pp. 425–440, 1991.

    Article  Google Scholar 

  12. Svatopluk Poljak and Daniel Turzik. A polynomial time algorithm for constructing a large bipartite subgraph, with an application to a satisfiability problem. Can. J. Math, Vol. 34, No. 3, pp. 519–524, 1982.

    Google Scholar 

  13. Alejandro A. Schaffer and Mihalis Yannakakis. Simple local search problems that are hard to solve. SIAM J. Comput., Vol. 20, No. 1, pp. 56–87, 1991.

    Article  Google Scholar 

  14. Paul Vitanyi. How well can a graph be n-colored? Discrete Math., Vol. 34, pp. 69–80, 1981.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, 152, Tokyo, Japan

    Hoong Chuin Lau

Authors
  1. Hoong Chuin Lau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Selim G. Akl Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lau, H.C. (1995). Approximation of Constraint Satisfaction via local search. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_85

Download citation

  • DOI: https://doi.org/10.1007/3-540-60220-8_85

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60220-0

  • Online ISBN: 978-3-540-44747-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation