TY  - JOUR

T1  - Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter

JO  - ACM Transactions on Algorithms

UR  - https://doi.org/10.1145/3632623

PY  - 2024/01/22

AU  - Chalermsook P

AU  - Kaul M

AU  - Mnich M

AU  - Spoerhase J

AU  - Uniyal S

AU  - Vaz D

ED  - 

DO  - DOI: 10.1145/3632623

PB  - Association for Computing Machinery (ACM)

VL  - 20

IS  - 1

SP  - 1

EP  - 20

Y2  - 2025/02/05

ER  -