Suding Liu

According to our database, Suding Liu authored at least 8 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

The prize-collecting single machine scheduling with bounds and penalties.

Guojun Hu, Pengxiang Pan, Suding Liu, Ping Yang, Runtao Xie

J. Comb. Optim., September, 2024

Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points.

Suding Liu

Optim. Lett., July, 2024

2023

Delay-constrained minimum shortest path trees and related problems.

Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang

Theor. Comput. Sci., 2023

Approximation algorithms for solving the heterogeneous Chinese postman problem.

Jianping Li, Pengxiang Pan, Junran Lichen, Lijian Cai, Wencheng Wang, Suding Liu

J. Comb. Optim., 2023

An Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree Problem.

Jianping Li, Suding Liu, Junran Lichen

Proceedings of the Combinatorial Optimization and Applications, 2023

2022

Approximation algorithms for solving the line-capacitated minimum Steiner tree problem.

Jianping Li, Wencheng Wang, Junran Lichen, Suding Liu, Pengxiang Pan

J. Glob. Optim., 2022

2021

An Approximation Algorithm for Solving the Heterogeneous Chinese Postman Problem.

Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan, Wencheng Wang, Suding Liu

Proceedings of the Algorithmic Aspects in Information and Management, 2021

2020

Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.

Jianping Li, Suding Liu, Junran Lichen, Wencheng Wang, Yujie Zheng

J. Comb. Optim., 2020