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...
Main Authors: | Simon Van den Eynde, Pieter Audenaert, Didier Colle, Mario Pickavet |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2022-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0270147 |
Similar Items
-
A construction heuristic for the capacitated Steiner tree problem
by: Simon Van den Eynde, et al.
Published: (2022-01-01) -
Policy-Compliant Maximum Network Flows
by: Pieter Audenaert, et al.
Published: (2019-02-01) -
Regular Equivalence for Social Networks
by: Pieter Audenaert, et al.
Published: (2018-12-01) -
An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations.
by: Ine Melckenbeeck, et al.
Published: (2016-01-01) -
Optimization of Steiner trees search in the flow Steiner tree problem
by: Valery Kukin
Published: (2018-06-01)