Sciweavers

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

99

Voted

STOC
2010
ACM

186views Algorithms» more STOC 2010»

Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph

15 years 1 months ago

Detecting high log-densities: an O(n1/4) approximation for densest k-subgraph

Download www.cs.princeton.edu

Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Ur

Real-time Traffic

Algorithms | STOC 2010 |

claim paper

Post Info
More Details (n/a)

Added	30 Jan 2011
Updated	30 Jan 2011
Type	Journal
Year	2010
Where	STOC
Authors	Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan

Comments (0)