arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.01902cs.DS
收藏

旅行锦标赛问题的 $5$ 近似算法

A $5$-approximation Algorithm for the Traveling Tournament Problem

Jingyang Zhao, Mingyu Xiao

AI总结:

本文针对旅行锦标赛问题(TTP-$k$)提出一个对所有 $k$ 和 $n$ 有效的 $5$ 近似算法,并证明当 $k \geq n/2$ 时近似比可改进至 $4$,修正了先前工作中的缺陷。

摘要:

旅行锦标赛问题(TTP-$k$)是锦标赛赛程安排中一个著名的基准问题,要求设计一个双循环赛程,使得所有 $n$ 支队伍的总旅行距离最小化,同时满足每对队伍在对方主场各比赛一场,且每支队伍连续主场或客场比赛不超过 $k$ 场。Westphal 和 Noparlik(Ann. Oper. Res. 218(1):347-360, 2014)声称对所有 $k\geq 4$ 和 $n\geq 6$ 存在一个 $5.875$ 近似算法。然而,他们的赛程构造和分析均存在缺陷。在本文中,我们证明对所有 $k$ 和 $n$ 存在一个 $5$ 近似算法。此外,如果 $k \geq n/2$,近似比可以改进到 $4$。

英文摘要:

The Traveling Tournament Problem (TTP-$k$) is a well-known benchmark problem in tournament timetabling, which asks us to design a double round-robin schedule such that the total traveling distance of all $n$ teams is minimized under the constraints that each pair of teams plays one game in each other's home venue, and each team plays at most $k$-consecutive home games or away games. Westphal and Noparlik (Ann. Oper. Res. 218(1):347-360, 2014) claimed a $5.875$-approximation algorithm for all $k\geq 4$ and $n\geq 6$. However, there were both flaws in the construction of the schedule and in the analysis. In this paper, we show that there is a $5$-approximation algorithm for all $k$ and $n$. Furthermore, if $k \geq n/2$, the approximation ratio can be improved to $4$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑