Runtao Xie

According to our database, Runtao Xie authored at least 7 papers between 2022 and 2026.

Collaborative distances:

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

2026

Approximation algorithms for the prize-collecting rural postman problem.

Hong Li, Jianping Li, Wei Li, Runtao Xie, Xiaoxiao Yang

CoRR, May, 2026

2025

On the Windy k-Traveling Salesman Problem.

Jianping Li, Xiaoxiao Yang, Junran Lichen, Wei Li, Runtao Xie, Ping Yang

Proceedings of the Theory and Applications of Models of Computation, 2025

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

On the Constrained Steiner Strong Connectivity Augmentation Problem.

Junran Lichen, Shuwen Ge, Runtao Xie, Ping Yang

Proceedings of the Combinatorial Optimization and Applications, 2024

2023

Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties.

Jianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang

J. Comb. Optim., April, 2023

2022

A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem.

Xiaofei Liu, Weidong Li, Runtao Xie

Optim. Lett., 2022

The Constrained Parallel-Machine Scheduling Problem with Divisible Processing Times and Penalties.

Jianping Li, Runtao Xie, Junran Lichen, Guojun Hu, Pengxiang Pan, Ping Yang

Proceedings of the Algorithmic Aspects in Information and Management, 2022