Karl Noparlik

Learn More
In this paper we propose an approximation for the Traveling Tournament Problem which is the problem of designing a schedule for a sports league consisting of a set of teams T such that the total traveling costs of the teams are minimized. Thereby, it is not allowed for any team to have more than k home-games or k away-games in a row. We propose an algorithm(More)
  • 1