An O(√n-approximation algorithm for directed sparsest cut

Mohammad Taghi Hajiaghayi, Harald Räcke

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

Fingerprint

Dive into the research topics of 'An O(√n-approximation algorithm for directed sparsest cut'. Together they form a unique fingerprint.

Keyphrases

Mathematics