Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Integrality gaps for Sherali-Adams relaxations
Proceedings of the forty-first annual ACM symposium on Theory of computing
Sherali-adams relaxations of the matching polytope
Proceedings of the forty-first annual ACM symposium on Theory of computing
CSP gaps and reductions in the lasserre hierarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
Optimal Sherali-Adams Gaps from Pairwise Independence
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Note: A simple algorithm for 4-coloring 3-colorable planar graphs
Theoretical Computer Science
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximating sparsest cut in graphs of bounded treewidth
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On the conditional hardness of coloring a 4-colorable graph with super-constant number of colors
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Integrality gaps of linear and semi-definite programming relaxations for Knapsack
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Linear index coding via semidefinite programming
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Wireless capacity with arbitrary gain matrix
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
We introduce a framework for studying semidefinite programming (SDP) relaxations based on the Lasserre hierarchy in the context of approximation algorithms for combinatorial problems. As an application of our approach, we give improved approximation algorithms for two problems. We show that for some fixed constant \varepsilon\le 0, given a 3- uniform hypergraph containing an independent set of size (\frac{1} {2} - \varepsilon )n, we can find an independent set of size \Omega (n^\varepsilon). This improves upon the result of Krivelevich, Nathaniel and Sudakov, who gave an algorithm finding an independent set of size \Omega (n^{6\gamma- 3} ) for hypergraphs with an independent set of size \gamma n (but no guarantee for \gamma\leqslant \frac{1} {2}. We also give an algorithm which finds an {\rm O}(n^{0.2072} )-coloring given a 3-colorable graph, improving upon the work of Arora, Chlamtac and Charikar. Our approach stands in contrast to a long series of inapproximability results in the Lovász Schrijver linear programming (LP) and SDP hierarchies for other problems.