Approximation algorithms for TTP(2)

DOI10.1007/S00186-012-0387-4MaRDI QIDQ1935936zbMATH OpenOpenAlexWikidataFDO

Authors Clemens Thielen, Stephan Westphal

Publication date 20 February 2013

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-012-0387-4

zbMATH Keywords

approximation algorithmssports schedulingtimetablingtraveling tournament problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Approximating the traveling tournament problem with maximum tour length 2
• An improved approximation algorithm for the traveling tournament problem
• An Improved Approximation Algorithm for the Traveling Tournament Problem
• A 5.875-approximation for the traveling tournament problem
• An improved approximation algorithm for the traveling tournament problem with maximum trip length two

Cites work

• A 5.875-approximation for the traveling tournament problem
• A simulated annealing approach to the traveling tournament problem
• An approximation algorithm for the traveling tournament problem
• An improved approximation algorithm for the traveling tournament problem
• Complexity of the traveling tournament problem
• scientific article; zbMATH DE number 2084735 (Why is no real title available?)
• Round robin scheduling -- a survey
• Scheduling in Sports
• Scheduling in sports: an annotated bibliography

Cited in

(17)

• An efficient algorithm for computing the approximate t-URV and its applications
• A new branch-and-price algorithm for the traveling tournament problem
• A further improvement on approximating TTP-2
• Approximating the traveling tournament problem with maximum tour length 2
• Generating approximate solutions to the TTP using a linear distance relaxation
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• An improved approximation algorithm for the traveling tournament problem with maximum trip length two
• A 5.875-approximation for the traveling tournament problem
• An approximation algorithm for the bipartite traveling tournament problem
• Unconstrained traveling tournament problem is APX-complete
• An improved scheduling algorithm for traveling tournament problem with maximum trip length two
• 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
• A 5-approximation algorithm for the traveling tournament problem
• Solving mirrored traveling tournament problem benchmark instances with eight teams

This page was built for publication: Approximation algorithms for \(\mathrm{TTP(2)}\)

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