A faster strongly polynomial time algorithm for submodular function minimization

Mathematical Programming

Volumn 118, Issue 2, 2009, Pages 237-251

  Orlin, James B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

COMBINATORIAL ALGORITHMS; POLYNOMIAL TIMES; RUNNING TIMES; SUBMODULAR FUNCTION MINIMIZATIONS; SUBMODULAR FUNCTIONS;

COMBINATORIAL MATHEMATICS;

EID: 58149485960     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-007-0189-2     Document Type: Article

References (18)

1. Berman A. and Plemmons R.J. (1994). Nonnegative Matrices in the Mathematical Sciences. SIAM, Philadelphia
2. Cormen T.H., Leiserson C.E., Rivest R.L. and Stein C. (2001). Introduction to Algorithms, 2nd edn. MIT Press, Cambridge
3. W.H. Cunningham 1985 On submodular function minimization Combinatorica 3 185 192
4. Edmonds J. (1970). Submodular functions, matroids and certain polyhedra. In: Guy, R., Hanani, H., Sauer, N., and Schönheim, J. (eds) Combinatorial Structures and Their Applications, pp 69-87. Gordon and Breach, New York
5. Fleischer, L.K.: Recent progress in submodular function minimization. Optima 1-11 (2000)
6. Fleischer, L.K., Iwata, S.: Improved algorithms for submodular function minimization and submodular flow. In: Proceedings of the 32th Annual ACM Symposium on Theory of Computing, pp. 107-116 (2000)
7. Fujishige S. (2005). Submodular Functions and Optimization, 2nd edn. North-Holland, Amsterdam
8. M. Grötschel L. Lovász A. Schrijver 1981 The ellipsoid algorithm and its consequences in combinatorial optimization Combinatorica 1 499 513
9. Grötschel M., Lovász L. and Schrijver A. (1988). Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg
10. S. Iwata 2002 A faster scaling algorithm for minimizing submodular functions SIAM J. Comput. 32 833 840
11. S. Iwata 2008 Submodular function minimization Math. Program. 112 45 64
12. S. Iwata L. Fleischer S. Fujishige 2001 A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions J. ACM 48 761 777
13. Lovász L. (1983). Submodular functions and convexity. In: Bachem, A., Grötschel, M. and Korte, B. (eds) Mathematical Programming-The State of the Art, pp 235-257. Springer, Berlin
14. McCormick, S.T.: Submodular function minimization. In: Aardal, K., Nemhauser, G., Weismantel, R. (eds.) Discrete Optimization. Handbooks in Operations Research and Management Science, vol. 12. Elsevier, Amsterdam (2005)
15. A. Schrijver 2000 A combinatorial algorithm minimizing submodular functions in strongly polynomial time J. Combin. Theory Ser. B 80 346 355
16. Schrijver A. (2003). Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin
17. L. Shapley 1971 Cores of convex games Int. J. Game Theory 1 11 26
18. J. Vygen 2003 A note on Schrijver's submodular function minimization algorithm J. Combin. Theory B 88 399 402