Daniel Vaz
Daniel Vaz
Home
Publications
Teaching
Contact
Light
Dark
Automatic
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
Parinya Chalermsook
,
Matthias Kaul
,
Matthias Mnich
,
Joachim Spoerhase
,
Sumedha Uniyal
,
Daniel Vaz
November, 2022
Cite
arXiv
Type
Journal article
Publication
Submitted
Daniel Vaz
Postdoc
My research centers around approximation algorithms for network design and other graph problems.
Cite
×