Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

COLOGNETWENTE
2010

favoriteEmaildiscussreport

188views Optimization» more COLOGNETWENTE 2010»

Approximating Independent Set in Semi-Random Graphs

13 years 3 months ago

Approximating Independent Set in Semi-Random Graphs

Download wwwhome.math.utwente.nl

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 ﬂipped independently with a probability of ε > 0. Our algorithm runs in expected polynomial time and guarantees an approximation ratio of roughly O( √ nε), which beats the inapproximability bounds.

Bodo Manthey, Kai Plociennik

Real-time Traffic

Algorithm | COLOGNETWENTE 2010 | Independent Set Problem | Optimization | Semi-random Graphs |

claim paper

Related Content

» A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs

» Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

» PTAS for maximum weight independent set problem with random weights in bounded degree grap...

» Approximation Algorithms for the Weighted Independent Set Problem

» Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

» Approximating minimum independent dominating sets in wireless networks

» Finding a Maximum Independent Set in a Sparse Random Graph

» Improved Approximations of Independent Sets in BoundedDegree Graphs

» Finding Independent Sets in Unions of Perfect Graphs

Post Info
More Details (n/a)

Added	24 Jan 2011
Updated	24 Jan 2011
Type	Journal
Year	2010
Where	COLOGNETWENTE
Authors	Bodo Manthey, Kai Plociennik

Comments (0)