Algorithms and Logic Group

Approximation Algorithms for the Traveling Tournament Problem with Maximum Tour Length Two

Seminars · Weekly Seminars
Speaker
Jingyang Zhao
Affiliation
University of Electronic and Science Technology of China
Date
Time
– Asia/Shanghai
Venue
Main Building

Abstract

The Traveling Tournament Problem is a complex combinatorial optimization problem in tournament timetabling, which asks us to design a double round-robin under several feasibility requirements such that the total distance traveled by all the n teams (n is even) is minimized. In this talk, we will focus on the problem where at most two consecutive home games or away games are allowed and I will introduce some results on approximation algorithms.

Schedule

  • 10:00-12:00 (Time in Beijing)
  • 14:00-16:00 (Time in Auckland)
  • May 07, 2021 (Friday)

Online Meeting

Link: https://meeting.tencent.com/s/smb8sodAC9nv

ID: 559 715 185