On Approximations for Constructing 1-Line Minimum Rectilinear Steiner Trees in the Euclidean Plane ℝ2. - Junran Lichen; Jianping Li 007; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (AAIM, 2020)

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem. - Jianping Li 007; Suding Liu; Junran Lichen; Wencheng Wang 003; Yujie Zheng (J. Comb. Optim., 2020)

An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem. - Jianping Li 007; Lijian Cai; Junran Lichen; Pengxiang Pan; Wencheng Wang 003; Suding Liu (AAIM, 2021)

On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane ${ mathbb {R}}^2$. - Jianping Li 007; Yujie Zheng; Junran Lichen; Wencheng Wang 003 (Optim. Lett., 2021)

1-line minimum rectilinear steiner trees and related problems. - Jianping Li 007; Junran Lichen; Wencheng Wang 003; Jean Yeh; Yeong-Nan Yeh; Xingxing Yu; Yujie Zheng (J. Comb. Optim., 2022)

Approximation algorithms for solving the line-capacitated minimum Steiner tree problem. - Jianping Li 007; Wencheng Wang 003; Junran Lichen; Suding Liu; Pengxiang Pan (J. Glob. Optim., 2022)

Bin packing with divisible item sizes and rejection penalties. - Jianping Li 007; Pengxiang Pan; Lijian Cai; Junran Lichen; Wencheng Wang 003 (Optim. Lett., 2022)

Approximation algorithms for solving the heterogeneous Chinese postman problem. - Jianping Li 007; Pengxiang Pan; Junran Lichen; Lijian Cai; Wencheng Wang 003; Suding Liu (J. Comb. Optim., 2023)

Delay-constrained minimum shortest path trees and related problems. - Junran Lichen; Lijian Cai; Jianping Li 007; Suding Liu; Pengxiang Pan; Wencheng Wang 003 (Theor. Comput. Sci., 2023)