跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

Given a real-valued submodular function on a finite ground set, the minimum kk-partition problem asks for a partition into kk nonempty parts minimizing the sum of their function values. We give a polynomial-time algorithm for k=5k=5. The idea follows directly from the previous k=4k=4 result, where there is precisely one obstruction for generalizing it to k=5k=5. We show the special case can be handled by reasoning about a restricted family of 33-partitions.

作者备注:11 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 kk-partition problem asks for a partition into kk nonempty parts minimizing the sum of their function values. We give a polynomial-time algorithm for k=5k=5. The idea follows directly from the previous k=4k=4 result, where there is precisely one obstruction for generalizing it to k=5k=5. We show the special case can be handled by reasoning about a restricted family of 33-partitions.

查看此版本解读 →查看此版本原文 ↗