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
1
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
Daniel Vaz
Postdoc

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