Round-Robin Tournaments with a Small Number of Breaks
نویسندگان
چکیده
The break minimization problem is to find a home-away assignment that minimizes the number of breaks for a given schedule of a round-robin tournament. In a recent paper, Elf et al. conjectured that this minimization problem is solvable in polynomial time if the optimal value of a given instance is less than the number of teams of the instance. We prove their conjecture affirmatively by showing that the decision problem we propose, which is related to the break minimization problem, is solvable in polynomial time. Our approach is to transform an instance of our decision problem into a collection of instances of 2SAT.
منابع مشابه
On the generalized English scheme for double round robin tournaments in sports scheduling
In this paper we propose the generalized English scheme for scheduling double round robin tournaments (DRRTs), a common topic in sports scheduling, to deal with the conflicting constraints of breaks and separation. In practice, usually a small number of breaks and a large separation are desirable, but typical methods of scheduling DRRTs cannot obtain both a minimum number of breaks and a positi...
متن کاملGlobal constraints for round robin tournament scheduling
In the presence of side-constraints and optimization criteria, round robin tournament problems are hard combinatorial problems, commonly tackled with tree search and branch-andbound optimization. Recent results indicate that constraint-based tree search has crucial advantages over integer programming-based tree search for this problem domain by exploiting global constraint propagation algorithm...
متن کاملStability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملSports tournaments, home-away assignments, and the break minimization problem
We consider the break minimization problem for fixing home-away assignments in round-robin sports tournaments. First, we show that for an opponent schedule with n teams and n− 1 rounds, there always exists a home-away assignment with at most 1 4n(n−2) breaks. Secondly, for infinitely many n, we construct opponent schedules for which at least 6n(n−1) breaks are necessary. Finally, we prove that ...
متن کاملRound-robin tournaments with homogeneous rounds
We study round-robin tournaments for n teams, where in each round a fixed number (g) of teams is present and each team present plays a fixed number (m) of matches in this round. In the tournament each match between two teams is either played once or twice, in the latter case in different rounds. We give necessary combinatorial conditions on the triples (n, g,m) for which such round-robin tourna...
متن کامل