Daniel Vaz
Daniel Vaz
Home
Publications
Teaching
Contact
Light
Dark
Automatic
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs
Parinya Chalermsook
,
Syamantak Das
,
Bundit Laekhanukit
,
Daniel Vaz
January, 2017
PDF
Cite
DOI
Preprint
Type
Conference paper
Publication
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19
Daniel Vaz
Postdoc
My research centers around approximation algorithms for network design and other graph problems.
Cite
×