A simpler and parallelizable
O
( √ log
n
)-approximation algorithm for Sparsest Cut
Vladimir Kolmogorov
.
In
ACM Symposium on Parallelism in Algorithms and Architectures
(
SPAA
), June 2024.
Links
arXiv