# An improved algorithm for the Steiner tree problem with bounded edge-length

1 引文 斯高帕斯（Scopus）

## 摘要

This work firstly studies the Steiner tree problem with bounded edge-length d in which d is the ratio of the maximum edge cost to the minimum edge cost. This work analyzes the algorithm of Byrka et al. [19] and shows that the approximation ratio of [Formula presented] for general graphs and approximation ratio of [Formula presented] for quasi-bipartite graphs. The algorithm implies approximation ratio of 1.162+ϵ for the problem on complete graphs with edge distances 1 and 2. This finding represents an improvement upon the previous best approximation ratio of 1.25. This work then presents a combinatorial two-phase heuristic for the general Steiner tree in greedy strategy that achieves an approximation ratio of 1.4295.

原文 English 20-36 17 Journal of Computer and System Sciences 123 https://doi.org/10.1016/j.jcss.2021.07.003 Published - 2022 2月

• 理論電腦科學
• 電腦網路與通信
• 計算機理論與數學
• 應用數學