1 Hit in 2.8 sec

A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem [article]

Daniel Schmand, Marc Schröder, Laura Vargas Koch
2021 arXiv   pre-print
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