Improved Decomposition Bounds for Partition Polytopes and Odd-Covers

Steffen Borgwardt, Zdeněk Dvořák, Bryce Frederickson +2

The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_1,\dots ,k_n$ can be encoded as the vertices of the partition polytope $\mathrm{PP}(k_1,\dots ,k_n)$. W…