论文信息 - A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗

A FASTER SCALING ALGORITHM FOR MINIMIZING SUBMODULAR FUNCTIONS∗

Combinatorial strongly polynomial algorithms for minimizing submodular functions have been developed by Iwata, Fleischer, and Fujishige (IFF) and by Schrijver. The IFF algorithm employs a scaling scheme for submodular functions, whereas Schrijver’s algorithm achieves strongly polynomial bound with the aid of distance labeling. Subsequently, Fleischer and Iwata have described a push/relabel version of Schrijver’s algorithm to improve its time complexity. This paper combines the scaling scheme with the push/relabel framework to yield a faster combinatorial algorithm for submodular function minimization. The resulting algorithm improves over the previously best known bound by essentially a linear factor in the size of the underlying ground set.

C. SIAMJ.

[1] L. Shapley. Cores of convex games , 1971 .

[2] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[3] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.

[4] William H. Cunningham,et al. Testing membership in matroid polyhedra , 1984, J. Comb. Theory, Ser. B.

[5] J. G. Pierce,et al. Geometric Algorithms and Combinatorial Optimization , 2016 .

[6] 藤重悟. Submodular functions and optimization , 1991 .

[7] Satoru Iwata,et al. A capacity scaling algorithm for convex cost submodular flows , 1996, SODA '96.

[8] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[9] Satoru Iwata,et al. Improved algorithms for submodular function minimization and submodular flow , 2000, STOC '00.

[10] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[11] Jack Edmonds,et al. Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[12] Satoru Iwata,et al. A fully combinatorial algorithm for submodular function minimization , 2001, SODA '02.

[13] Satoru Iwata,et al. A push-relabel framework for submodular function minimization and applications to parametric optimization , 2003, Discret. Appl. Math..