We stand with Ukraine  

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 13 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An Improved Approximation Algorithm for Metric Triangle Packing.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
CoRR, 2024

Improved Approximation Algorithms for Cycle and Path Packings.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
Proceedings of the WALCOM: Algorithms and Computation, 2024

2023
Minimum-Weight Link-Disjoint Paths With a Bounded Number of Shared Nodes.
[BibTeX]
[DOI]
Binglin Tao
,
Mingyu Xiao
,
Jingyang Zhao
IEEE Trans. Netw. Serv. Manag., September, 2023

A 5-approximation Algorithm for the Traveling Tournament Problem.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
CoRR, 2023

The APX-hardness of the Traveling Tournament Problem.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
CoRR, 2023

Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

The Linear Distance Traveling Tournament Problem Allows an EPTAS.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
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.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
CoRR, 2022

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
CoRR, 2022

Improved Approximation Algorithms for the Traveling Tournament Problem.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
,
Chao Xu
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.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

A Further Improvement on Approximating TTP-2.
[BibTeX]
[DOI]
Jingyang Zhao
,
Mingyu Xiao
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes.
[BibTeX]
[DOI]
Binglin Tao
,
Mingyu Xiao
,
Jingyang Zhao
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020


  Loading...