Work

O(√log n) approximation to SPARSEST CUT in Õ(n 2) time

Year: 2004

Type: article

Authors: Sanjeev Arora, Elad Hazan, Satyen Kale

Institution: Princeton University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W3016299094

FWCI: 1.396

Cites:

Cited by: 13

Related to: 10