PDF-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
Download Presentation
Download Note : "Approximating independent sets in sparse graphs Nikhil" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.