@inproceedings{9e72210bbcb84a9882d2f0ea1bc60f69,

title = "Approximating coloring and maximum independent sets in 3-uniform hypergraphs",

keywords = "Algorithms, Theory, Verification",

author = "Michael Krivelevich and Ram Nathaniel and Benny Sudakov",

note = "Funding Information: We discuss approximation algorithms for the coloring problem and the maximum independent set problem in 3-uniform hypergraphs. An algorithm for coloring 3-uniform 2-colorable hypergraphs in O˜(n) colors is presented, improving1 5 previously known results. Also, for every fixed γ 1 2, we describe an algorithm that, given a 3-uniform hypergraph H on n vertices with an independent set of size γn,findsanindependentsetofsizeΩ˜(min(n,n6γ 3)).Forcertainvaluesofγ we are able to improve this using the local ratio approach. The results are obtained through semidefinite programming relaxations of these optimization problems. 2001 Academic Press 1An extended abstract of this paper appeared in the Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA {\textquoteright}2001). 2Supported by a U.S.A.—Israeli BSF grant. 3Research supported in part by NSF grants DMS-0106589 and CCR-9987845 and by the State of New Jersey.; 2001 Operating Section Proceedings, American Gas Association ; Conference date: 30-04-2001 Through 01-05-2001",

year = "2001",

language = "אנגלית",

isbn = "0898714907",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

pages = "327--328",

booktitle = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms",

}