A faster scaling algorithm for minimizing submodular functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2337 LNCS, Issue , 2002, Pages 1-8

  Iwata, Satoru ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; COMBINATORIAL MATHEMATICS; OPTIMIZATION;

COMBINATORIAL ALGORITHM; DISTANCE LABELING; SCALING ALGORITHM; SCALING SCHEMES; STRONGLY POLYNOMIAL ALGORITHM; SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS; S-ALGORITHMS;

COMBINATORIAL MATHEMATICS; ALGORITHMS;

EID: 23044533511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47867-1_1     Document Type: Conference Paper

References (14)

1. W. H. Cunningham: Testing membership in matroid polyhedra. J. Combinatorial Theory, Ser. B, 36 (1984) 161-188.
2. W. H. Cunningham: On submodular function minimization. Combinatorica 5 (1985) 185-192.
3. J. Edmonds: Submodular functions, matroids, and certain polyhedra. Combinatorial Structures and Their Applications, R. Guy, H. Hanani, N. Sauer, and J. Schönheim, eds., Gordon and Breach, pp. 69-87, 1970.
4. L. Fleischer and S. Iwata: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math., to appear.
5. L. Fleischer, S. Iwata, and S. T. McCormick: A faster capacity scaling algorithm for submodular flow. Math. Programming, to appear.
6. S. Fujishige: Submodular Functions and Optimization, North-Holland, 1991.
7. M. Grötschel, L. Lovász, and A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197.
8. M. Grötschel, L. Lovász, and A. Schrijver: Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988.
9. S. Iwata: A capacity scaling algorithm for convex cost submodular flows. Math. Programming 76 (1997) 299-308.
10. S. Iwata: A fully combinatorial algorithm for submodular function minimization. J. Combinatorial Theory, Ser. B, to appear.
11. S. Iwata, L. Fleischer, and S. Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48 (2001) 761-777.
12. L. Lovász: Submodular functions and convexity, Mathematical Programming - The State of the Art, A. Bachem, M. Grötschel, and B. Korte, eds., Springer-Verlag, 1983, pp. 235-257.
13. A. Schrijver: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory, Ser. B, 80 (2000) 346-355.
14. L. S. Shapley: Cores of convex games. Int. J. Game Theory 1 (1971) 11-26.