Approximating independent set in semi-random graphs


Manthey, Bodo and Plociennik, Kai (2010) Approximating independent set in semi-random graphs. In: 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2010, 25-27 May 2010, Cologne, Germany (pp. pp. 119-122).

open access
Abstract:We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipped independently with a probability of $\varepsilon > 0$. Our algorithm runs in expected polynomial time and guarantees an approximation ratio of roughly $O(\sqrt{\varepsilon n})$, which beats the inapproximability bounds.
Item Type:Conference or Workshop Item
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Conference URL:
Proceedings URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page