no. 16 · Tuesday 17 November 2026
A Polynomial Time Algorithm for Finding a Minimum 5-Partition of a Submodular Function
Abstract
Given a real-valued submodular function on a finite ground set, the minimum $k$-partition problem asks for a partition into $k$ nonempty parts minimizing the sum of their function values. We give a polynomial-time algorithm for $k=5$. The idea follows directly from the previous $k=4$ result, where there is precisely one obstruction for generalizing it to $k=5$. We show the special case can be handled by reasoning about a restricted family of $3$-partitions.
- comments
- 11 pages
- fields
- Combinatorics