.png){kind=icon}
返回
An approximation algorithm for the traveling tournament problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-010-0742-x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes the traveling tournament problem, a well-known benchmark problem in the field of tournament timetabling. We propose a new lower bound for the traveling tournament problem, and construct a randomized approximation algorithm yielding a feasible solution whose approximation ratio is less than 2+(9/4)/(n-1), where n is the number of teams. Additionally, we propose a deterministic approximation algorithm with the same approximation ratio using a derandomization technique. For the traveling tournament problem, the proposed algorithms are the first approximation algorithms with a constant approximation ratio, which is less than 2+3/4.
Keyword:
Traveling tournament problem
Lower bound
Approximation algorithm
Tournament
Timetabling
Scheduling
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
Outcomes for Management of Lichen Sclerosus Urethral Strictures by 3 Different Techniques.png)
Urology
UrologyIF0
PREAI
分享收藏Average spreading of a linear Gaussian–Schell model beam array in non-Kolmogorov turbulence线性高斯-谢尔模型光束阵列在非科尔莫戈罗夫湍流中的平均扩展
PREAI
分享收藏
A Computationally Efficient Method to Determine Iron and Magnet Losses in VSI-PWM Fed Axial Flux Permanent Magnet Synchronous Machines一种有效的计算方法来确定vsi-pwm供电的轴向磁通永磁同步电机中的铁和磁体损耗
PREAI
分享收藏 没有更多内容
没有更多内容