Cite
HARVARD Citation
Zhang, H. et al. (2016). A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs. Journal of algorithms & computational technology. 10 (2), pp. 99-114. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Zhang, H. et al. (2016). A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs. Journal of algorithms & computational technology. 10 (2), pp. 99-114. [Online].