Advertisement

Non-oblivious local search for graph and hypergraph coloring problems

  • Paola Alimonti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)

Keywords

Local Search Local Optimum Approximation Ratio Boolean Variable Logical Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 3.
    G. Ausiello, A. D'Atri, D. Saccà, Graph Algorithms for Functional Dependency Manipulation, Journal of ACM, 30, 752–766, 1983.Google Scholar
  4. 4.
    G. Ausiello, and G.F. Italiano, On-Line Algorithms for Polynomially Solvable Satisfiability Problems, Journal of Logic Programming, 10, 69–90, 1991.CrossRefGoogle Scholar
  5. 5.
    G. Ausiello, and M. Protasi, Local Search, Reducibility and Approximability of NP Optimization Problems, Information Processing Letters, 1995 (to appear).Google Scholar
  6. 6.
    C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973.Google Scholar
  7. 7.
    M. Garey, and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.Google Scholar
  8. 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. 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. 10.
    V. Kann, J. Lagergren, A. Panconesi, Approximability of Maximum Splitting of k-Sets, Unpublished Manuscript, 1995.Google Scholar
  11. 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. 12.
    C. Papadimitriou, and K. Steiglitz, Combinatorial Optimization Algorithms and Optimization, Prentice-Hall, Englewood Cliffs, New Jersey, 1982.Google Scholar
  13. 13.
    C. Papadimitriou, and M. Yannakakis, Optimization, Approximation, and Complexity Classes, Journal of Computer and System Sciences, 43, 425–440, 1991.CrossRefGoogle Scholar
  14. 14.
    D. Saccà, Closure of Database Hypergraphs, Journal of ACM, 32, 774–803, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Paola Alimonti
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”;RomaItalia

Personalised recommendations