LogDynamics
Projekte
School
Lab
LDIC
Doctoral Workshop
Bild verbergen/Bild anzeigen
Newsletter
Kontakt
Impressum
LogDynamics
›
Publikationen
›
Papers
› Contributions to Conferences
LogDynamics
Ziele
Historie
Mitglieder
Publikationen
Papers
Contributions to Journals
Contributions to Conferences
Contributions to Collections
Books
Theses
Studies
Public Relations
Presse
Aktuelles
Suche
Contributions to Conferences
back
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics
Authors
Böhm, M.
Hoeksma, R.
Megow, N.
Nölke, L.
Simon, B.
Meta information
[BibTeX]
Year: 2020, Reviewed
In: Proc. of the 45th International Symposium on Mathematical Foundations of Computer Science
Böhm, M.; Hoeksma, R.; Megow, N.; Nölke, L.; Simon, B.
Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics
In: Proc. of the 45th International Symposium on Mathematical Foundations of Computer Science. 2020,
(Workgroup:
CSLog
)
BibTeX
Close
@inproceedings{Boeh20, author = {B{\"o}hm, M. and Hoeksma, R. and Megow, N. and N{\"o}lke, L. and Simon, B.}, title = {Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics}, booktitle = {Proc. of the 45th International Symposium on Mathematical Foundations of Computer Science}, year = {2020}, editor = {}, publisher = {}, doi = {}, pages = {} }
Download as .bib