


default search action
"A Simpler and Parallelizable O(√log n)-approximation Algorithm for ..."
Vladimir Kolmogorov (2024)
- Vladimir Kolmogorov
:
A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut. SPAA 2024: 403-414

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.