Skip to main content
SpringerLink
Log in

Non-oblivious local search for graph and hypergraph coloring problems

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 1995)

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

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. P. Alimonti,and E. Feuerstein, Petri Nets, Hypergraphs and Conflicts, Proc. of the 18th International Workshop on Graph-Theoretic Concept in Computer Science, LNCS 657, 293–309, 1992.

    Google Scholar 

  2. P. Alimonti, New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems, Proc. 2nd Italian Conference on Algorithms and Complexity, LNCS 788, 40–53, 1994.

    Google Scholar 

  3. G. Ausiello, A. D'Atri, D. Saccà, Graph Algorithms for Functional Dependency Manipulation, Journal of ACM, 30, 752–766, 1983.

    Google Scholar 

  4. G. Ausiello, and G.F. Italiano, On-Line Algorithms for Polynomially Solvable Satisfiability Problems, Journal of Logic Programming, 10, 69–90, 1991.

    Article  Google Scholar 

  5. G. Ausiello, and M. Protasi, Local Search, Reducibility and Approximability of NP Optimization Problems, Information Processing Letters, 1995 (to appear).

    Google Scholar 

  6. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.

    Google Scholar 

  7. M. Garey, and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.

    Google Scholar 

  8. M. Goemans, and D.P. Williamson,. 878-Approximation Algorithms for MAX CUT and MAX 2SAT, Proc. of the 35th Annual IEEE Conference on Foundations of Computer Science, 1994.

    Google Scholar 

  9. D.S. Johnson, C.H. Papadimitriou, and M. Yannakakis, How Easy Is Local Search?, Journal of Computer and System Sciences, 37, 79–100, 1988.

    Google Scholar 

  10. V. Kann, J. Lagergren, A. Panconesi, Approximability of Maximum Splitting of k-Sets, Unpublished Manuscript, 1995.

    Google Scholar 

  11. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani, On Syntactic versus Computational Views of Approximability, Proc. of the 35th Annual IEEE Conference on Foundations of Computer Science, 1994.

    Google Scholar 

  12. C. Papadimitriou, and K. Steiglitz, Combinatorial Optimization Algorithms and Optimization, Prentice-Hall, Englewood Cliffs, New Jersey, 1982.

    Google Scholar 

  13. C. Papadimitriou, and M. Yannakakis, Optimization, Approximation, and Complexity Classes, Journal of Computer and System Sciences, 43, 425–440, 1991.

    Article  Google Scholar 

  14. D. Saccà, Closure of Database Hypergraphs, Journal of ACM, 32, 774–803, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”;, via Salaria 113, 00198, Roma, Italia

    Paola Alimonti

Authors
  1. Paola Alimonti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Nagl

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alimonti, P. (1995). Non-oblivious local search for graph and hypergraph coloring problems. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1995. Lecture Notes in Computer Science, vol 1017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-60618-1_74

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation