Approximating sparsest cut in low-treewidth graphs via combinatorial diameter

Chalermsook, ParinyaParinyaChalermsookKaul, MatthiasMatthiasKaulMnich, MatthiasMatthiasMnichSpoerhase, JoachimJoachimSpoerhaseUniyal, SumedhaSumedhaUniyalVaz, DanielDanielVaz2021-11-152021-11-152021arXiv: 2111.06299 (2021)http://hdl.handle.net/11420/10926enhttp://arxiv.org/licenses/nonexclusive-distrib/1.0/MathematikApproximating sparsest cut in low-treewidth graphs via combinatorial diameterPreprint10.15480/882.414210.48550/arXiv.2111.0629910.15480/882.41422111.06299Preprint