Metraipolis › archive › dc_2bfb9e450041
Steiner Tree Parameterized by Multiway Cut: Single-Exponential Time and Polynomial Space — arXiv:2610.41519
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41519
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:49:22.681Z
- SHA-256 of the archived text
7a63d805057031f4eaa6fb08e9bc691b0966fb8aa6d7863433777ad67444772b- Stable URL of this page
https://metraipolis.com/documento/dc_2bfb9e450041
How to cite
Steiner Tree Parameterized by Multiway Cut: Single-Exponential Time and Polynomial Space — arXiv:2610.41519 — arXiv (en), https://arxiv.org/abs/2610.41519 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2bfb9e450041 (Metraipolis archive dc_2bfb9e450041, sha256 7a63d805057031f4eaa6fb08e9bc691b0966fb8aa6d7863433777ad67444772b)
BibTeX
@misc{dc2bfb9e450041,
title = {Steiner Tree Parameterized by Multiway Cut: Single-Exponential Time and Polynomial Space — arXiv:2610.41519},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41519},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2bfb9e450041; sha256 7a63d805057031f4eaa6fb08e9bc691b0966fb8aa6d7863433777ad67444772b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41519. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the Steiner Tree problem, the goal is to find a minimum-weight tree containing a given set of terminals in an edge-weighted graph. Given a multiway cut of size $s$, we propose a deterministic algorithm running in $2^{O(s)}\operatorname{poly}(n,b)$ time and polynomial space ($n$ vertices, non-negative $b$-bit integer weights). A multiway cut for the terminals is a set of vertices whose deletion leaves at most one terminal in each connected component. This result answers a question of Jansen and Swennenhuis (ESA 2024). Building on their component decomposition, we show that it suffices to connect the selected cut vertices together with $O(s)$ additional terminals and attach the remaining terminals by shortest paths. We use colour coding to optimize over the choice of these additional terminals.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.41519 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T05:34:47.021Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).