Sciweavers

APPROX
2008
Springer
94views Algorithms» more  APPROX 2008»
14 years 2 months ago
Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
Eden Chlamtac, Gyanit Singh