3 papers
cs.DS2025
Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
Jingyang Zhao, Mingyu Xiao
The Capacitated Vehicle Routing Problem (CVRP) is one of the most extensively studied problems in combinatorial optimization. Based on customer demand, we distinguish three variant…
cs.DS2025
The APX-hardness of the Traveling Tournament Problem
Jingyang Zhao, Mingyu Xiao
The Traveling Tournament Problem (TTP-) is a well-known benchmark problem in sports scheduling, which asks us to design a double round-robin schedule such that each pair of team…
cs.DS2025
Breaking the Barrier for Subset Feedback Vertex Set in Chordal Graphs
Tian Bai, Mingyu Xiao
The Subset Feedback Vertex Set problem (SFVS), to delete vertices from a given graph such that any vertex in a vertex subset (called a terminal set) is not in a cycle in the re…