Sciweavers

139
Voted
COLOGNETWENTE
2010
15 years 12 days ago
Approximating Independent Set in Semi-Random Graphs
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 flipp...
Bodo Manthey, Kai Plociennik