Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz
November, 2023
Preprint Cite DOI arXiv
Type
2
Publication
ACM Transactions on Algorithms
Daniel Vaz
Daniel Vaz
Postdoc

My research centers around approximation algorithms and parameterized complexity for network design and graph problems.