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

Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, Aravindan Vijayaraghavan. Detecting high log-densities: an ::::O::::(::::n:::::::1/4:::) approximation for densest ::::k::::-subgraph. In Leonard J. Schulman, editor, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010. pages 201-210, ACM, 2010. [doi]

Abstract

Abstract is missing.