A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs

DOI10.1177/1748301816640714MaRDI QIDQ6551932zbMATH OpenFDO

Authors Hao Zhang, Dongyi Ye, Wenzhong Guo

Publication date 7 June 2024

Published in Journal of Algorithms \& Computational Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1177/1748301816640714

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551932)