A matching-based approximation algorithm for the traveling tournament problem

DOI10.1016/J.TCS.2025.115485MaRDI QIDQ6908097zbMATH OpenFDO

Authors Jingyang Zhao, Mingyu Xiao

Publication date 1 November 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115485

zbMATH Keywords

approximation algorithmssports schedulingtimetabling combinatorial optimizationtraveling tournament problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• A 5-approximation algorithm for the traveling tournament problem
• A 5.875-approximation for the traveling tournament problem
• A combined local search and integer programming approach to the traveling tournament problem
• A simulated annealing and hill-climbing algorithm for the traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• An approximation algorithm for the bipartite traveling tournament problem
• An approximation algorithm for the traveling tournament problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An improved approximation algorithm for the traveling tournament problem
• An improved scheduling algorithm for traveling tournament problem with maximum trip length two
• Approximation algorithms for \(\mathrm{TTP(2)}\)
• Complexity of the traveling tournament problem
• Complexity of the unconstrained traveling tournament problem
• Heuristics for the mirrored traveling tournament problem
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• Improved approximation algorithms for the traveling tournament problem
• Maximum flow and minimum-cost flow in almost-linear time
• Practical algorithms with guaranteed approximation ratio for traveling tournament problem with maximum tour length 2
• RobinX: a three-field classification and unified data format for round-robin sports timetabling
• Sports scheduling and other topics in sports analytics: a survey with special reference to Latin America
• The design of approximation algorithms
• Unconstrained traveling tournament problem is APX-complete

This page was built for publication: A matching-based approximation algorithm for the traveling tournament problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908097)