M. Krivelevich, R. Nathaniel, and B. Sudakov. Approximating coloring and maximum independent sets in 3-uniform hypergraphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 327--328, Washington, DC, January 7--9, 2001. SIAM, Philadelphia, PA.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Hardness of 3 Uniform Hypergraph Coloring Irit Dinur Oded Regev Cli ord Smyth April 25, 2002 Abstract We prove that coloring a 3 uniform 2 colorable hypergraph with any constant number of colors is NP hard. The best known algorithm [20] colors such a graph using O(n ) colors. Our result immediately implies that for any constants k 2 and c 2 c 1 1, coloring a k uniform c 1 colorable hypergraph with c 2 colors is NP hard; leaving completely open only the k = 2 graph case. We are the rst to obtain a hardness result ....

....Study, Princeton, NJ. E Mail: firitd,odedr,csmythg ias.edu. Research supported by NSF grant CCR 9987845. The best algorithms for these problems require a polynomial number of colors: for example the best approximate coloring algorithm for 2 colorable 3 uniform hypergraphs requires O(n colors [20], and the best coloring algorithm for 3 colorable graphs, requires O(n ) colors [5] On the lower bound side, not much is known. For graphs, the best hardness result states that using 4 colors to color a 3 colorable graph is NP hard [17, 13] It would already be a signi cant step to prove ....

Krivelevich, Nathaniel, and Sudakov. Approximating coloring and maximum independent sets in 3-uniform hypergraphs. ALGORITHMS: Journal of Algorithms, 41, 2001.

.... of coloring hypergraphs have been studied mostly due to its connection to important graph coloring and satisfiability problems (cf. e.g. 10, 26] Extending the approximation results for graph coloring, several authors have provided approximation algorithms for coloring 2 colorable hypergraphs [2, 9, 23, 24]. For example, the very recent polynomial time approximation algorithm from [23] colors any 3 uniform 2 colorable hypergraphs using O(n 1=5 ) colors. Testing colorability. We are not aware of any prior work on testing hypergraphs properties. Goldreich et al. 20] were the first who studied the ....

.... coloring and satisfiability problems (cf. e.g. 10, 26] Extending the approximation results for graph coloring, several authors have provided approximation algorithms for coloring 2 colorable hypergraphs [2, 9, 23, 24] For example, the very recent polynomial time approximation algorithm from [23] colors any 3 uniform 2 colorable hypergraphs using O(n 1=5 ) colors. Testing colorability. We are not aware of any prior work on testing hypergraphs properties. Goldreich et al. 20] were the first who studied the problem of testing colorability in graphs (although implicitly this problem ....

M. Krivelevich, R. Nathaniel, and B. Sudakov. Approximating coloring and maximum independent sets in 3-uniform hypergraphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 327--328, Washington, DC, January 7--9, 2001. SIAM, Philadelphia, PA.

No context found.

M. Krivelevich, R. Nathaniel, and B. Sudakov. Approximating coloring and maximum independent sets in 3-uniform hypergraphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 327--328, Washington, DC, January 7--9, 2001. SIAM, Philadelphia, PA.

No context found.

M. Krivelevich, R. Nathaniel, and B. Sudakov. Approximating coloring and maximum independent sets in 3-uniform hypergraphs. J. Algorithms, 41:99--113, 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC