Polynomial algorithm for $k$partition minimization of monotone submodular function
Abstract
For a fixed $k$, this study considers $k$partition minimization of submodular system $(V, f)$ with a finite set $V$ and symmetric submodular function $f: 2^{V} \mapsto \mathbb{R}$. Our algorithm uses the Queyranne's (1998) algorithm for 2partition minimization which arises at each step of the recursive decomposition of subsets of the original $k$partition minimization. We show that the computational complexity of this minimizer is $O(n^{3(k1)})$.
 Publication:

arXiv eprints
 Pub Date:
 February 2018
 arXiv:
 arXiv:1802.01914
 Bibcode:
 2018arXiv180201914H
 Keywords:

 Mathematics  Optimization and Control;
 90C27;
 65K05