A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
We consider the maximum independent set problem on sparse graphs with maximum degree d. The best known result for the problem is an SDP based O(d log log d/ log d) approximation due to Halperin. It is also known that no o(d/ log 2 d) approximation exists assuming the Unique Games Conjecture. We show the following two results: (i) The natural LP formulation for the problem strengthened by O(log 4 (d)) levels of the mixed-hierarchy has an integrality gap ofÕ(d/ log 2 d), whereÕ(·) ignores somedoi:10.1137/1.9781611973730.1 dblp:conf/soda/Bansal15 fatcat:wpu6fwegxfejhf3agykpyok62u