Fingerprint Dive into the research topics of 'O(√log n) approximation to sparsest cut in õ(n<sup>2</sup>) time'. Together they form a unique fingerprint.
- Sort by
- Weight
- Alphabetically
O(√log n) approximation to sparsest cut in õ(n2) time
Sanjeev Arora, Elad Hazan, Satyen Kale
Research output: Contribution to journal › Article › peer-review
25
Scopus
citations