Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs

Author： Krivelevich M.   Nathaniel R.   Sudakov B.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.41, Iss.1, 2001-10, pp. : 99-113

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A note on random greedy coloring of uniform hypergraphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. : 407-413

John Wiley & Sons Inc

Access to resources Recommend Favorite

Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs

By  

JOURNAL OF COMBINATORIAL DESIGNS, Vol. 23, Iss. 11, 2015-11 ,pp. : 499-508

John Wiley & Sons Inc

Access to resources Recommend Favorite

The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set

By Lau H.Y.   Ting H.F.  

Journal of Combinatorial Optimization, Vol. 5, Iss. 4, 2001-12 ,pp. : 411-420

Springer Publishing Company

Access to resources Recommend Favorite

List coloring triangle‐free hypergraphs

By  

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 3, 2015-10 ,pp. : 487-519

John Wiley & Sons Inc

Access to resources Recommend Favorite

Approximate Set Covering in Uniform Hypergraphs

By Krivelevich M.  

Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. : 118-143

Academic Press

Access to resources Recommend Favorite