SDP-based algorithms for maximum independent set problems on hypergraphs

Authors:
Geir Agnarsson;Magnús M. Halldórsson;Elena Losievskaja
Affiliations:
Department of Mathematical Sciences, George Mason University, Fairfax, VA, USA;School of Computer Science, Reykjavik University, 101 Reykjavik, Iceland;School of Computer Science, Reykjavik University, 101 Reykjavik, Iceland
Venue:
Theoretical Computer Science
Year:
2013

Citing 14
Cited 0

Improved lower bounds on k-independence

Journal of Graph Theory
Approximate graph coloring by semidefinite programming

Journal of the ACM (JACM)
Approximating the independence number via the j -function

Mathematical Programming: Series A and B
Derandomizing Approximation Algorithms Based on Semidefinite Programming

SIAM Journal on Computing
Approximating coloring and maximum independent sets in 3-uniform hypergraphs

Journal of Algorithms
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs

SIAM Journal on Computing
Approximations of Independent Sets in Graphs

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximating Maximum Clique by Removing Subgraphs

SIAM Journal on Discrete Mathematics
Finding Large Independent Sets in Graphs and Hypergraphs

SIAM Journal on Discrete Mathematics
On the differential approximation of MIN SET COVER

Theoretical Computer Science
Independent sets in bounded-degree hypergraphs

Discrete Applied Mathematics
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
The complexity of finding independent sets in bounded degree (hyper)graphs of low chromatic number

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the Shannon capacity of a graph

IEEE Transactions on Information Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper deals with approximations of maximum independent 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@?loglogD@?/logD@?) 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.