Back to Results
First PageMeta Content
NP-complete problems / Analysis of algorithms / Approximation algorithms / Time complexity / Independent set / Ε-net / Property testing / Theoretical computer science / Mathematics / Computational complexity theory


Approximating Independent Set in Semi-Random Graphs Bodo Manthey a Kai Plociennik b a University of Twente, Department of Applied Mathematics
Add to Reading List

Document Date: 2011-08-28 15:19:04

Open Document

File Size: 242,73 KB

Share Result on Facebook

Country

Netherlands / /

/

IndustryTerm

approximation algorithm / brute-force search / greedy algorithm / approximation algorithms / /

Organization

Department of Applied Mathematics P. O. Box / University of Twente / /

Person

Joe Kilian / Amin Coja-Oghlan / David Zuckerman / Kai Plociennik / Van H. Vu / Michael Krivelevich / Uriel Feige / /

PublishedMedium

Theory of Computing / /

Technology

3 approximation algorithms / Approximation algorithm / /

SocialTag