Cargando…
A construction heuristic for the capacitated Steiner tree problem
Many real-life problems boil down to a variant of the Minimum Steiner Tree Problem (STP). In telecommunications, Fiber-To-The-Home (FTTH) houses are clustered so they can be connected with fiber as cost-efficiently as possible. The cost calculation of a fiber installment can be formulated as a capac...
Autores principales: | Van den Eynde, Simon, Audenaert, Pieter, Colle, Didier, Pickavet, Mario |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9202893/ https://www.ncbi.nlm.nih.gov/pubmed/35709229 http://dx.doi.org/10.1371/journal.pone.0270147 |
Ejemplares similares
-
The Steiner tree problem
por: Hwang, FK, et al.
Publicado: (1992) -
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations
por: Melckenbeeck, Ine, et al.
Publicado: (2016) -
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
por: Houbraken, Maarten, et al.
Publicado: (2014) -
Bounded Degree Group Steiner Tree Problems
por: Kortsarz, Guy, et al.
Publicado: (2020) -
Steiner trees in industry
por: Cheng, Xiu, et al.
Publicado: (2001)