A faster deterministic approximation algorithm for TTP-2

DOI10.15807/JORSJ.68.99MaRDI QIDQ6922954zbMATH OpenFDO

Authors Yuga Kanaya, Kenjiro Takazawa

Publication date 30 September 2025

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/JORSJ.68.99

zbMATH Keywords

approximation algorithmcombinatorial optimizationsports schedulingtraveling tournament problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cites work

• A 2.75-approximation algorithm for the unconstrained traveling tournament problem
• A further improvement on approximating TTP-2
• An approximation algorithm for the traveling tournament problem
• An improved approximation algorithm for the traveling tournament problem
• An improved approximation algorithm for the traveling tournament problem with maximum trip length two
• 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
• Faster scaling algorithms for general graph matching problems
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3598198 (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
• Practical algorithms with guaranteed approximation ratio for traveling tournament problem with maximum tour length 2
• Some models of graphs for scheduling sports competitions

This page was built for publication: A faster deterministic approximation algorithm for TTP-2

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