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
This provides a simple polynomial time constant factor approximation algorithm for the social golfer problem. We extend the results to the Oberwolfach problem. ... We show that a simple greedy approach guarantees at least ⌊n+4/6⌋ rounds for the Oberwolfach problem. ... Acknowledgement This research started after supervising the Master's thesis of David Kuntz. We thank David for valuable discussions. ...arXiv:2007.10704v3 fatcat:zrw7tczeeverfni743s6z3jguu