Abstract
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 Õ(n1/5) colors is presented, improving 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, finds an independent set of size Ω̃(min(n,n6γ−3)). For certain values of γ we are able to improve this using the local ratio approach. The results are obtained through semidefinite programming relaxations of these optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.