A greedy algorithm for the social golfer and the Oberwolfach problem
Abstract: Highlights•We bound the number of clique-factors that can be greedily deleted from a complete graph.•We bound the number of cycle-factors that can be greedily deleted from a complete graph.•The derived bounds are essentially tight.•Our results imply constant factor polynomial time approximation algorithms.•Our results imply a guarantee on the number of rounds in any Swiss-system tournament.
Loading