An improved scheduling algorithm for traveling tournament problem with maximum trip length two

DOI10.4230/OASICS.ATMOS.2021.16MaRDI QIDQ6587294zbMATHFDO

Authors Diptendu Chatterjee, Bimal Roy

Publication date 13 August 2024

zbMATH Keywords

approximationschedulingtraveling tournament problemdouble round-Robin

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• An improved approximation algorithm for the traveling tournament problem with maximum trip length two
• Approximation algorithms for \(\mathrm{TTP(2)}\)
• 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

This page was built for publication: An improved scheduling algorithm for traveling tournament problem with maximum trip length two

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