Feasibility of home-away-pattern sets for round robin tournaments
暂无分享,去创建一个
A Home-Away-Pattern (HAP) set defines each team's venue in each period. We consider the decision problem of whether a round robin tournament can be arranged on the basis of a given HAP set. We give a necessary condition which can be checked in polynomial time and conjecture it to be sufficient.
[1] Tomomi Matsui,et al. Characterizing Feasible Pattern Sets with a Minimum Number of Breaks , 2002, PATAT.
[2] Gerhard J. Woeginger,et al. Sports tournaments, home-away assignments, and the break minimization problem , 2006, Discret. Optim..
[3] P. Harker,et al. Scheduling a Major College Basketball Conference , 1998 .