A faster scaling algorithm for minimizing submodular functions

SIAM Journal on Computing

Volumn 32, Issue 4, 2003, Pages 833-840

  Iwata, Satoru ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Algorithm; Discrete optimization; Subrnodular function

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; POLYNOMIALS;

DISCRETE OPTIMIZATION;

FUNCTION EVALUATION;

EID: 0141534137     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701397813     Document Type: Article

References (17)

1. M. AIGNER, Combinatorial Theory, Springer-Verlag, Berlin, New York, 1979.
2. W. H. CUNNINGHAM, Testing membership in matroid polyhedra, J. Combin. Theory Ser. B, 36 (1984), pp. 161-188.
3. W. H. CUNNINGHAM, On submodular function minimization, Combinatorica, 5 (1985), pp. 185-192.
4. J. EDMONDS, Submodular functions, matroids, and certain polyhedra, in Combinatorial Structures and Their Applications, R. Guy, H. Hanani, N. Sauer, and J. Schönheim, eds., Gordon and Breach, New York, 1970, pp. 69-87.
5. L. FLEISCHER AND S. IWATA, Improved algorithms for submodular function minimization and submodular flow, in Proceedings of the 32nd ACM Symposium on Theory of Computing, Portland, OR, 2000, ACM, New York, 2000, pp. 107-116.
6. L. FLEISCHER AND S. IWATA, A push-relabel framework for submodular function minimization and applications to parametric optimization, Discrete Appl. Math., to appear.
7. L. FLEISCHER, S. IWATA, AND S. T. McCoRMiCK, A faster capacity scaling algorithm for submodular flow, Math. Program., 92 (2002), pp. 119-139.
8. S. FUJISHIGE, Submodular Functions and Optimization, North-Holland, Amsterdam, 1991.
9. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
10. M. GRÖTSCHEL, L. LovÁsz, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
11. S. IWATA, A capacity scaling algorithm for convex cost submodular flows, Math. Programming, 76 (1997), pp. 299-308.
12. S. IWATA, A fully combinatorial algorithm for submodular function minimization, J. Combin. Theory Ser. B, 84 (2002), pp. 203-212.
13. S. IWATA, L. FLEISCHER, AND S. FUJISHIGE, A combinatorial strongly polynomial algorithm for minimizing submodular functions, J. ACM, 48 (2001), pp. 761-777.
14. L. LovÁsz, Submodular functions and convexity, in Mathematical Programming -The State of the Art, A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, Berlin, 1983, pp. 235-257.
15. S. T. McCoRMiCK, Submodular function minimization, in Handbook of Discrete Optimization, K. Aardal, G. Nemhauser, and R. Weismantel, eds., Eisevier, New York, to appear.
16. A. SCHRIJVER, A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combin. Theory Ser. B, 80 (2000), pp. 346-355.
17. L. S. SHAPLEY, Cores of convex games, Internat. J. Game Theory, 1 (1971), pp. 11-26.