论文信息 - Approximate Hypergraph Coloring

Approximate Hypergraph Coloring

A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic. We are interested in the problem of coloring 2-colorable hypergraphs. For the special case of graphs (hypergraphs of dimension 2) this can easily be done in linear time. The problem for general hypergraphs is much more difficult since a result of Lovasz implies that the problem is NP-hard even if all hyperedges have size three.

Noga Alon | Pierre Kelsen | Ramesh Hariharan | Sanjeev Mahajan

[1] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[2] Ramesh Hariharan,et al. Derandomizing semidefinite programming based approximation algorithms , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[3] Avrim Blum,et al. New approximation algorithms for graph coloring , 1994, JACM.

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

[5] Alan M. Frieze,et al. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION , 1995, IPCO.

[6] Noga Alon,et al. Approximating the independence number via theϑ-function , 1998, Math. Program..

[7] Alan M. Frieze,et al. Coloring Bipartite Hypergraphs , 1996, IPCO.

[8] Farid Alizadeh,et al. Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[9] Avi Wigderson,et al. Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[10] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

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

[12] David R. Karger,et al. Approximate graph coloring by semidefinite programming , 1998, JACM.