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.

 Preview
PDF
242Kb
 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 . Our algorithm runs in expected polynomial time and guarantees an approximation ratio of roughly , which beats the inapproximability bounds. Item Type: Conference or Workshop Item Faculty: Electrical Engineering, Mathematics and Computer Science (EEMCS) Research Group: Link to this item: http://purl.utwente.nl/publications/75055 Conference URL: http://ctw.uni-koeln.de/ Proceedings URL: http://ctw.uni-koeln.de/CTW2010.pdf Export this item as: BibTeXEndNoteHTML CitationReference Manager

Repository Staff Only: item control page