A faster strongly polynomial time algorithm for submodular function minimization

被引：138

作者：

Orlin, James B. ^{[1
]}

机构：

[1] MIT, Alfred P Sloan Sch Management, Cambridge, MA 02139 USA

来源：

MATHEMATICAL PROGRAMMING | 2009年 / 118卷 / 02期

关键词：

Distance Function; Greedy Algorithm; Corner Point; Distance Vector; Combinatorial Algorithm;

D O I：

10.1007/s10107-007-0189-2

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 n. We also extend our result to ring families.

引用

页码：237 / 251

页数：15

共 50 条

[1] A faster strongly polynomial time algorithm for submodular function minimization
Orlin, James B.
[J]. Integer Programming and Combinatorial Optimization, Proceedings, 2007, 4513 : 240 - 251
[2] A faster strongly polynomial time algorithm for submodular function minimization
James B. Orlin
[J]. Mathematical Programming, 2009, 118 : 237 - 251
[3] A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Schrijver, A
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2000, 80 (02) : 346 - 355
[4] A strongly polynomial time algorithm for a constrained submodular optimization problem
Hartvigsen, D
[J]. DISCRETE APPLIED MATHEMATICS, 2001, 113 (2-3) : 183 - 194
[5] A strongly polynomial algorithm for line search in submodular polyhedra
Nagano, Kiyollito
[J]. DISCRETE OPTIMIZATION, 2007, 4 (3-4) : 349 - 359
[6] A combinatorial strongly polynomial algorithm for minimizing submodular functions
Iwata, S
Fleischer, L
Fujishige, S
[J]. JOURNAL OF THE ACM, 2001, 48 (04) : 761 - 777
[7] A Simple Combinatorial Algorithm for Submodular Function Minimization
Iwata, Satoru
Orlin, James B.
[J]. PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 1230 - +
[8] A fully combinatorial algorithm for submodular function minimization
Iwata, S
[J]. PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 915 - 919
[9] A fully combinatorial algorithm for submodular function minimization
Iwata, S
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 84 (02) : 203 - 212
[10] A STRONGLY POLYNOMIAL ALGORITHM FOR MINIMUM COST SUBMODULAR FLOW PROBLEMS
FUJISHIGE, S
ROCK, H
ZIMMERMANN, U
[J]. MATHEMATICS OF OPERATIONS RESEARCH, 1989, 14 (01) : 60 - 69

← 1 2 3 4 5 →