Sitemap

A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.

Pages

Page Not Found

Research Interest

Archive Layout with Content

Posts by Category

Posts by Collection

CV

Markdown

Page not in menu

Page Archive

Portfolio (to do)

Publications

Sitemap

Posts by Tags

Talk map

Talks

Teaching

Terms and Privacy Policy

Blog posts

Jupyter notebook markdown generator

Posts

portfolio

publications

Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes

  • Binglin Tao, Mingyu Xiao, Jingyang Zhao
  • Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
-->

The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound

  • Jingyang Zhao, Mingyu Xiao
  • Thirtieth International Joint Conference on Artificial Intelligence, 2021
-->

A Further Improvement on Approximating TTP-2

  • Jingyang Zhao, Mingyu Xiao
  • Computing and Combinatorics - 27th International Conference, 2021
-->

Improved Approximation Algorithms for the Traveling Tournament Problem

  • Jingyang Zhao, Mingyu Xiao, Chao Xu
  • 47th International Symposium on Mathematical Foundations of Computer Science, 2022
-->

Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes

  • Binglin Tao, Mingyu Xiao, Jingyang Zhao
  • IEEE Transactions on Network and Service Management, 2023
-->

The Linear Distance Traveling Tournament Problem Allows an EPTAS

  • Jingyang Zhao, Mingyu Xiao
  • Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023
-->

Improved Approximation Algorithms for Multidepot Capacitated Vehicle Routing

  • Jingyang Zhao, Mingyu Xiao
  • Computing and Combinatorics - 29th International Conference, 2023
-->

Improved Approximation Algorithms for Cycle and Path Packings

  • Jingyang Zhao, Mingyu Xiao
  • 18th International Conference and Workshops on Algorithms and Computation, 2024
-->

An Improved Approximation Algorithm for Metric Triangle Packing

  • Jingyang Zhao, Mingyu Xiao
  • Theory and Applications of Models of Computation - 18th Annual Conference, 2024
-->

A Better Approximation for Bipartite Traveling Tournament in Inter-League Sports Scheduling

  • Jingyang Zhao, Mingyu Xiao
  • Thirty-Third International Joint Conference on Artificial Intelligence, 2024
-->

Improved Approximation Algorithms for Capacitated Location Routing

  • Jingyang Zhao, Mingyu Xiao, Shunwang Wang
  • Thirty-Third International Joint Conference on Artificial Intelligence, 2024
-->

A deterministic approximation algorithm for metric triangle packing

  • Jingyang Zhao, Mingyu Xiao
  • Theoretical Computer Science, 2024
-->

Improved Approximation Algorithms for the Cumulative Vehicle Routing Problem

  • Jingyang Zhao, Mingyu Xiao
  • Neural Information Processing - 31st International Conference, 2024
-->

Approximation Algorithms for Cumulative Vehicle Routing with Stochastic Demands

  • Jingyang Zhao, Mingyu Xiao
  • 35th International Symposium on Algorithms and Computation, 2024
-->

A 5-approximation algorithm for the traveling tournament problem

  • Jingyang Zhao, Mingyu Xiao
  • Annals of Operations Research, 2025
-->

A Matching-Based Algorithm for the Traveling Tournament Problem

  • Jingyang Zhao, Mingyu Xiao
  • Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025
-->

Improved Approximation Algorithms for Clustered TSP and Subgroup Planning

  • Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong
  • Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025
-->

Approximation algorithms for cycle and path partitions in complete graphs

  • Jingyang Zhao, Mingyu Xiao
  • Theoretical Computer Science, 2025
-->

Practical Algorithms with Guaranteed Approximation Ratio for Traveling Tournament Problem with Maximum Tour Length 2

  • Jingyang Zhao, Mingyu Xiao
  • Mathematics of Operations Research, 2025
-->

Multidepot capacitated vehicle routing with improved approximation guarantees

  • Jingyang Zhao, Mingyu Xiao
  • Theoretical Computer Science, 2025
-->

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity

  • Jingyang Zhao, Mingyu Xiao
  • 50th International Symposium on Mathematical Foundations of Computer Science, 2025
-->

The APX-hardness of the Traveling Tournament Problem

  • Jingyang Zhao, Mingyu Xiao
  • Operations Research Letters, 2025
-->

A matching-based approximation algorithm for the traveling tournament problem

  • Jingyang Zhao, Mingyu Xiao
  • Theoretical Computer Science, 2025
-->

The traveling tournament problem: Improved algorithms based on cycle packing

  • Jingyang Zhao, Mingyu Xiao, Chao Xu
  • Theoretical Computer Science, 2025
-->

Improved Approximations for the Capacitated Vehicle Routing Problem with Fixed Capacity

  • Jingyang Zhao, Mingyu Xiao
  • Information and Computation, 2026
-->

Sustained Vertex Cover on Temporal Graphs

  • Junqiang Peng, Tian Bai, Jingyang Zhao, Mingyu Xiao
  • 35th International World Wide Web Conference, 2026
-->

FPT Approximation Algorithms for TSP on Non-Metric Graphs

  • Jingyang Zhao, Zimo Sheng, Mingyu Xiao
  • Fortieth AAAI Conference on Artificial Intelligence, 2026
-->

A TSP-Based Algorithm for Multi-League Traveling Tournament

  • Jingyang Zhao, Mingyu Xiao, Ken-ichi Kawarabayashi
  • Fortieth AAAI Conference on Artificial Intelligence, 2026
-->

Improved Algorithms for Trip-Vehicle Assignment in Ride-Sharing

  • Jingyang Zhao, Mingyu Xiao, Yonghang Su
  • Fortieth AAAI Conference on Artificial Intelligence, 2026
-->

Better Approximation Algorithms for Clustered TSP and Subgroup Planning

  • Jingyang Zhao, Mingyu Xiao, Junqiang Peng, Ziliang Xiong
  • Computers & Operations Research, 2026
-->

An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling

  • Jingyang Zhao, Mingyu Xiao
  • Mathematics of Operations Research, 2026
-->

talks

Approximation Algorithms for the Traveling Tournament Problem

Published:

Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity

Published:

teaching

xxx

xxx course, University xxx, Department xxx, 2025

</p>