English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs

MPS-Authors
/persons/resource/persons44225

Chalermsook,  Parinya
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons180826

Laekhanukit,  Bundit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons182530

Vaz,  Daniel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Chalermsook, P., Das, S., Laekhanukit, B., & Vaz, D. (2017). Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 737-751). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.47.


Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-573D-3
Abstract
There is no abstract available