A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs
The underlying models of many practical problems in various engineering fields are equivalent to the Steiner tree problem in graphs, which is a typical NP-hard combinatorial optimization problem. Thus, developing a fast and effective heuristic for the Steiner tree problem in graphs is of universal s...
Main Authors: | Hao Zhang, Dong-Yi Ye, Wen-Zhong Guo |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2016-06-01
|
Series: | Journal of Algorithms & Computational Technology |
Online Access: | https://doi.org/10.1177/1748301816640714 |
Similar Items
-
Node-weighted Steiner tree and group Steiner tree in planar graphs
by: Demaine, Erik D., et al.
Published: (2011) -
Exact and heuristic algorithms for the Euclidean Steiner tree problem
by: Van Laarhoven, Jon William
Published: (2010) -
Obstacle-Avoiding Heuristics for Steiner Tree Problem in EDA
by: Tsung-Huang Lin, et al.
Published: (2006) -
Optimization of Steiner trees search in the flow Steiner tree problem
by: Valery Kukin
Published: (2018-06-01) -
A bicriterion Steiner tree problem on graph
by: Vujošević Mirko B., et al.
Published: (2003-01-01)