Improved approximation algorithms for the traveling tournament problem

DOI10.4230/LIPICS.MFCS.2022.83MaRDI QIDQ6584089zbMATH OpenFDO

Authors Jingyang Zhao, Mingyu Xiao, Chao Xu

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.83

zbMATH Keywords

approximation algorithmsports schedulingtraveling tournament problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(6)

• The APX-hardness of the traveling tournament problem
• The traveling tournament problem: improved algorithms based on cycle packing
• A matching-based approximation algorithm for the traveling tournament problem
• A faster deterministic approximation algorithm for TTP-2
• Short note on a short proof of a variant of the round-robin scheduling problem
• A 5-approximation algorithm for the traveling tournament problem

This page was built for publication: Improved approximation algorithms for the traveling tournament problem

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