# A New Algorithm for the Robust Semi-random Independent Set Problem

arXiv: https://arxiv.org/abs/1808.03633 · HTML: https://mlsanity.com/paper/1808.03633/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Aug 2018.

## Built on by (most cited first, 1 of 1)

- [Robust Detection of Planted Subgraphs in Semi-Random Models](https://mlsanity.com/paper/2508.02158/) (2025)

## Abstract (arXiv)

In this paper, we study a general 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=Omega(n2/3). This improves on Feige and Kilian's original randomized algorithm, which with high probability recovers an independent set of size at least k when k=α n where α is a constant.