%0 Journal Article %1 chalermsook-etal24:sparsest-cut-tree-width %A Chalermsook, Parinya %A Kaul, Matthias %A Mnich, Matthias %A Spoerhase, Joachim %A Uniyal, Sumedha %A Vaz, Daniel %D 2024 %J ACM Transactions on Algorithms %K approximability cut key myown sparsest tree-width %R 10.1145/3632623 %T Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter %U https://doi.org/10.1145/3632623

@article{chalermsook-etal24:sparsest-cut-tree-width, added-at = {2023-11-17T19:02:40.000+0100}, author = {Chalermsook, Parinya and Kaul, Matthias and Mnich, Matthias and Spoerhase, Joachim and Uniyal, Sumedha and Vaz, Daniel}, biburl = {https://www.bibsonomy.org/bibtex/2f865e4279723f7e78dc1b683bf91346b/jspoerhase}, doi = {10.1145/3632623}, interhash = {ab546ec65ac1ff464edac200e34d0644}, intrahash = {f865e4279723f7e78dc1b683bf91346b}, journal = {ACM Transactions on Algorithms}, keywords = {approximability cut key myown sparsest tree-width}, note = {to appear}, timestamp = {2023-11-17T19:02:40.000+0100}, title = {Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter}, url = {https://doi.org/10.1145/3632623}, year = 2024 }