← 研踪 PaperTrailarXiv:2611.21187 · v1
A Polynomial Time Algorithm for Finding a Minimum 5-Partition of a Submodular Function
首次提交 2026-11-16 22:42
版本更新 2026-11-16 22:42
雷达观测 2026-11-17 17:11
摘要
Given a real-valued submodular function on a finite ground set, the minimum -partition problem asks for a partition into nonempty parts minimizing the sum of their function values. We give a polynomial-time algorithm for . The idea follows directly from the previous result, where there is precisely one obstruction for generalizing it to . We show the special case can be handled by reasoning about a restricted family of -partitions.
作者备注:11 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 22:42 · 最新观测版本
A Polynomial Time Algorithm for Finding a Minimum 5-Partition of a Submodular Function
Given a real-valued submodular function on a finite ground set, the minimum -partition problem asks for a partition into nonempty parts minimizing the sum of their function values. We give a polynomial-time algorithm for . The idea follows directly from the previous result, where there is precisely one obstruction for generalizing it to . We show the special case can be handled by reasoning about a restricted family of -partitions.
查看此版本解读 →查看此版本原文 ↗