Jingyang Zhao

Orcid: 0000-0003-2322-750X

Affiliations:
  • University of Electronic Science and Technology of China, Chengdu, Sichuan, China


According to our database1, Jingyang Zhao authored at least 40 papers between 2020 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem.
CoRR, January, 2026

Improved Approximations for Dial-a-Ride Problems.
CoRR, January, 2026

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem.
CoRR, January, 2026

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling.
Math. Oper. Res., 2026

Enhanced approximation algorithms for the capacitated location routing problem.
Inf. Comput., 2026

Improved approximations for the capacitated vehicle routing problem with fixed capacity.
Inf. Comput., 2026

Better approximation algorithms for clustered TSP and subgroup planning.
Comput. Oper. Res., 2026

Sustained Vertex Cover on Temporal Graphs.
Proceedings of the ACM Web Conference 2026, 2026

Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

A TSP-Based Algorithm for Multi-League Traveling Tournament.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

FPT Approximation Algorithms for TSP on Non-Metric Graphs.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
An Improved Approximation Algorithm for Maximum Weight 3-Path Packing.
CoRR, December, 2025

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem.
CoRR, August, 2025

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands.
CoRR, July, 2025

Improved FPT Approximation Algorithms for TSP.
CoRR, March, 2025

A 5-approximation algorithm for the traveling tournament problem.
Ann. Oper. Res., March, 2025

The traveling tournament problem: Improved algorithms based on cycle packing.
Theor. Comput. Sci., 2025

A matching-based approximation algorithm for the traveling tournament problem.
Theor. Comput. Sci., 2025

Multidepot capacitated vehicle routing with improved approximation guarantees.
Theor. Comput. Sci., 2025

Approximation algorithms for cycle and path partitions in complete graphs.
Theor. Comput. Sci., 2025

The APX-hardness of the Traveling Tournament Problem.
Oper. Res. Lett., 2025

Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2.
Math. Oper. Res., 2025

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity.
Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

A Matching-Based Algorithm for the Traveling Tournament Problem.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
A deterministic approximation algorithm for metric triangle packing.
Theor. Comput. Sci., 2024

Improved Approximation Algorithms for Cycle and Path Packings.
Proceedings of the WALCOM: Algorithms and Computation, 2024

An Improved Approximation Algorithm for Metric Triangle Packing.
Proceedings of the Theory and Applications of Models of Computation, 2024

Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands.
Proceedings of the 35th International Symposium on Algorithms and Computation, 2024

Improved Approximation Algorithms for Capacitated Location Routing.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Improved Approximation Algorithms for the Cumulative Vehicle Routing Problem.
Proceedings of the Neural Information Processing - 31st International Conference, 2024

2023
Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes.
IEEE Trans. Netw. Serv. Manag., September, 2023

Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

The Linear Distance Traveling Tournament Problem Allows an EPTAS.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Practical Algorithms with Guaranteed Approximation Ratio for TTP with Maximum Tour Length Two.
CoRR, 2022

Improved Approximation Algorithms for the Traveling Tournament Problem.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021
The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

A Further Improvement on Approximating TTP-2.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020


  Loading...