Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics

Martin Böhm, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Bertrand Simon

Research output: Working paper

44 Downloads (Pure)
  • 1 Conference contribution
  • 1 Preprint

Search results

  • 2020

    Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics

    Böhm, M., Hoeksma, R., Megow, N., Nölke, L. & Simon, B., 18 Aug 2020, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Esparza, J. & Kráľ, D. (eds.). Dagstuhl, Germany: Dagstuhl, p. 18:1-18:15 MFCS-2020-18. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

    Open Access
    File
    1 Citation (Scopus)
    44 Downloads (Pure)

  • On Hop-Constrained Steiner Trees in Tree-Like Metrics

    Böhm, M., Hoeksma, R., Megow, N., Nölke, L. & Simon, B., 12 Mar 2020, ArXiv.org.

    Research output: Working paper › Preprint › Academic

    Open Access
    File
    31 Downloads (Pure)