Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SPAA
/
Paper
A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut.
Vladimir Kolmogorov
Venue
B
SPAA
Year
2024
Proceedings
SPAA
DBLP record
conf/spaa/Kolmogorov24 ↗
Browse the full
SPAA paper archive
.