论文信息 - Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems - 字舞流文

Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems

Paola Alimonti | P. Alimonti

[1] Giorgio Ausiello,et al. Local Search, Reducibility and Approximability of NP-Optimization Problems , 1995, Inf. Process. Lett..

[2] Alessandro Panconesi,et al. Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems , 1996, Inf. Process. Lett..

[3] Paola Alimonti. New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems , 1994, CIAC.

[4] David P. Williamson,et al. .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.

[7] Giuseppe F. Italiano,et al. On-Line Algorithms for Polynomially Solvable Satisfiability Problems , 1991, J. Log. Program..

[8] Domenico Saccà. Closures of database hypergraphs , 1985, JACM.

[9] Esteban Feuerstein,et al. Petri Nets, Hypergraphs and Conflicts (Preliminary Version) , 1992, WG.

[10] Giorgio Ausiello,et al. Graph Algorithms for Functional Dependency Manipulation , 1983, JACM.

[11] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[12] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.