SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs

This paper deals with approximations of maximum indepen- dent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in terms of the maximum or average degree of the hypergraph. We extend this to the weighted case and give a O( ¯ D log log ¯ D/log ¯ D) bound, where ¯ D is the average weighted degree in a hypergraph, matching the best bounds known for the special case of graphs. Our approach is to use an semi-definite technique to sparsify a given hypergraph and then apply combinatorial algorithms to find a large independent set in the resulting sparser instance.