A New Algorithm for the Robust Semi-random Independent Set Problem
share
In this paper, we study a semi-random version of the planted independent set problem in a model initially proposed by Feige and Kilian, which has a large proportion of adversarial edges. We give a new deterministic algorithm that finds a list of independent sets, one of which, with high probability, is the planted one, provided that the planted set has size k=Ω(n^2/3).
READ FULL TEXT