首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Tight bounds for break minimization in tournament scheduling
Authors:Andries E Brouwer  Gerhard F Post  Gerhard J Woeginger  
Institution:aDepartment of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;bDepartment of Applied Mathematics, University Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands
Abstract:We consider round-robin sports tournaments with n teams and n−1 rounds. We construct an infinite family of opponent schedules for which every home-away assignment induces at least View the MathML source breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature.
Keywords:Latin squares  Sports scheduling  Sports tournament  Break minimization
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号