PublicationsPapers

Random order greedy up to 4 parts

Yuval Filmus
Manuscript

We analyze random order greedy, a variant of the greedy algorithm for partition matroids, when the number of parts is small.

We show that the approximation ratio in the case of 2 parts is 2/3, and in the case of 3 parts is 7/12. We also give bounds on the approximation ratio in the case of 4 parts.

BibTeX

@unpublished{Filmus2018,
 title = {Random order greedy up to 4 parts},
 author = {Yuval Filmus},
 howpublished = {Manuscript},
 year = {2018}
}
copy to clipboard