Work

A Polynomial Time Algorithm for Finding a Minimum 5-Partition of a Submodular Function

Year: 2026
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W7234786742
Cites: 6
Cited by:
Related to: 9