Approximating independent sets in sparse graphs Nikhil

The best known result for the problem is an SDP based log log d log approximation due to Halperin It is also known that no d log approximation exists assuming the Unique Games Conjecture We show the following two results i The natural LP formulatio

Embed this Presentation

Download Notice

Download Presentation The PPT/PDF document "Approximating independent sets in sparse..." is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.