Work

O( p logn) approximation to SPARSEST CUT can be found in

Year: 2004

Type: article

Authors: Sanjeev Arora, Elad Hazan, Satyen Kale

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: W2182295363

FWCI:

Cites: 24

Cited by:

Related to: 10