Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes. - Binglin Tao; Mingyu Xiao 001; Jingyang Zhao 001 (AAAI, 2020)

A Further Improvement on Approximating TTP-2. - Jingyang Zhao 001; Mingyu Xiao 001 (COCOON, 2021)

The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound. - Jingyang Zhao 001; Mingyu Xiao 001 (IJCAI, 2021)

Improved Approximation Algorithms for the Traveling Tournament Problem. - Jingyang Zhao 001; Mingyu Xiao 001; Chao Xu 002 (MFCS, 2022)

Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two. - Jingyang Zhao 001; Mingyu Xiao 001 (CoRR, 2022)

The Linear Distance Traveling Tournament Problem Allows an EPTAS. - Jingyang Zhao 001; Mingyu Xiao 001 (AAAI, 2023)

Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing. - Jingyang Zhao 001; Mingyu Xiao 001 (COCOON (2), 2023)

Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes. - Binglin Tao; Mingyu Xiao 001; Jingyang Zhao 001 (IEEE Trans. Netw. Serv. Manag., 2023)

Improved Approximation Algorithms for the Cumulative Vehicle Routing Problem. - Jingyang Zhao 001; Mingyu Xiao 001 (ICONIP (1), 2024)

A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling. - Jingyang Zhao 001; Mingyu Xiao 001 (IJCAI, 2024)

Improved Approximation Algorithms for Capacitated Location Routing. - Jingyang Zhao 001; Mingyu Xiao 001; Shunwang Wang (IJCAI, 2024)

Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands. - Jingyang Zhao 001; Mingyu Xiao 001 (ISAAC, 2024)

An Improved Approximation Algorithm for Metric Triangle Packing. - Jingyang Zhao 001; Mingyu Xiao 001 (TAMC, 2024)

Improved Approximation Algorithms for Cycle and Path Packings. - Jingyang Zhao 001; Mingyu Xiao 001 (WALCOM, 2024)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing. - Jingyang Zhao 001; Mingyu Xiao 001; Chao Xu 002 (CoRR, 2024)

A deterministic approximation algorithm for metric triangle packing. - Jingyang Zhao 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2024)

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning. - Jingyang Zhao 001; Mingyu Xiao 001; Junqiang Peng 001; Ziliang Xiong (AAAI, 2025)

A Matching-Based Algorithm for the Traveling Tournament Problem. - Jingyang Zhao 001; Mingyu Xiao 001 (AAAI, 2025)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity. - Jingyang Zhao 001; Mingyu Xiao 001 (MFCS, 2025)

Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2. - Jingyang Zhao 001; Mingyu Xiao 001 (Math. Oper. Res., 2025)

The APX-hardness of the Traveling Tournament Problem. - Jingyang Zhao 001; Mingyu Xiao 001 (Oper. Res. Lett., 2025)

Approximation algorithms for cycle and path partitions in complete graphs. - Jingyang Zhao 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

Multidepot capacitated vehicle routing with improved approximation guarantees. - Jingyang Zhao 001; Mingyu Xiao 001 (Theor. Comput. Sci., 2025)

A 5-approximation algorithm for the traveling tournament problem. - Jingyang Zhao 001; Mingyu Xiao 001 (Ann. Oper. Res., 2025)

Improved FPT Approximation Algorithms for TSP. - Jingyang Zhao 001; Zimo Sheng; Mingyu Xiao 001 (CoRR, 2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem. - Jingyang Zhao 001; Mingyu Xiao 001; Shunwang Wang (CoRR, 2025)

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling. - Jingyang Zhao 001; Mingyu Xiao 001 (CoRR, 2025)