Cargando…
Bounded Degree Group Steiner Tree Problems
Motivated by some open problems posed in [13], we study three problems that seek a low degree subtree T of a graph [Formula: see text]. In the Min-Degree Group Steiner Tree problem we are given a collection of node subsets (groups), and T should contain a node from every group. In the Min-Degree Ste...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7254898/ http://dx.doi.org/10.1007/978-3-030-48966-3_26 |