The following publications are possibly variants of this publication:
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${\mathbb {R}}^2$Jianping Li, Yujie Zheng, Junran Lichen, Wencheng Wang. ol, 15(2):669-683, 2021. [doi]
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problemJianping Li, Suding Liu, Junran Lichen, Wencheng Wang, Yujie Zheng. jco, 39(2):492-508, 2020. [doi]
- 1-line minimum rectilinear steiner trees and related problemsJianping Li, Junran Lichen, Wencheng Wang, Jean Yeh, Yeong-Nan Yeh, Xingxing Yu, Yujie Zheng. jco, 44(4):2832-2852, 2022. [doi]
- Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$Jianping Li, Haiyan Wang, Binchao Huang, Junran Lichen. jgo, 57(3):783-801, 2013. [doi]
- Approximation Algorithm for Bottleneck Steiner Tree Problem in the Euclidean PlaneZi-mao Li, Da-Ming Zhu, Shao-Han Ma. jcst, 19(6):791-794, 2004. [doi]
- An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean planeLusheng Wang, Zimao Li. ipl, 81(3):151-156, 2002. [doi]