B Yang,
W Zheng - Knowledge and Information Systems, 2023 - Springer
Steiner minimum tree problem on a graph, ie, finding a tree with the minimum weight that
covers the set of terminal nodes, is a classical NP-hard problem. Thus, we develop a method …