A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem
[article]
2021
arXiv
pre-print
Inspired by the increasing popularity of Swiss-system tournaments in sports, we study the problem of predetermining the number of rounds that can be guaranteed in a Swiss-system tournament. Matches of these tournaments are usually determined in a myopic round-based way dependent on the results of previous rounds. Together with the hard constraint that no two players meet more than once during the tournament, at some point it might become infeasible to schedule a next round. For tournaments with
arXiv:2007.10704v3
fatcat:zrw7tczeeverfni743s6z3jguu