A faster strongly polynomial time algorithm for submodular function minimization

被引：0
|
作者：
Orlin, James B. [1 ]
机构：
[1] MIT, Alfred P Sloan Sch Management, Cambridge, MA 02139 USA
来源：
Integer Programming and Combinatorial Optimization, Proceedings | 2007年 / 4513卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the problem of minimizing a submodular function f defined on a set V with n elements. We give a combinatorial algorithm that runs in O(n(5) EO + n(6)) time, where EO is the time to evaluate f(S) for some S subset of V. This improves the previous best strongly polynomial running time by more than a factor of
引用
收藏
页码：240 / 251
页数：12
相关论文
共 50 条
12345