"A Simpler and Parallelizable \(\boldsymbol{O(\sqrt{\log ..."

Vladimir Kolmogorov (2025)

> Home

Details and statistics

DOI: 10.1145/3748723

access: closed

type: Journal Article

metadata version: 2025-10-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/Kolmogorov25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/Kolmogorov25
Vladimir Kolmogorov:
A Simpler and Parallelizable \(\boldsymbol{O(\sqrt{\log n})}\)-Approximation Algorithm for Sparsest Cut. ACM Trans. Algorithms 21(4): 46:1-46:22 (2025)

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.