A faster strongly polynomial time algorithm for submodular function minimization

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

Volumn 4513 LNCS, Issue , 2007, Pages 240-251

  Orlin, James B ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; POLYNOMIALS;

COMBINATORIAL ALGORITHMS; POLYNOMIAL RUNNING TIME; SUBMODULAR FUNCTIONS;

INTEGER PROGRAMMING;

EID: 38049074797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_19     Document Type: Conference Paper

References (15)

1. Berman, A., and Plemmons R. J.: Nonnegative Matrices in the Mathematical Sciences, SIAM, 1994.
2. Cunningham, W. H.. On Submodular Function Minimization: Combinatorica 3 (1985) 185-192.
3. Edmonds, J.: 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 (1970) 69-87.
4. Fleischer, L. K.: Recent Progress in Submodular Function Minimization. Optima, 2000, 1-11.
5. Fleischer, L.K. and Iwata, S.: Improved Algorithms for Submodular Function Minimization and Submodular Flow. Proceedings of the 32th Annual ACM Symposium on Theory of Computing (2000) 107-116.
6. Fujishige, S.: Submodular Functions and Optimization. Second Edition. North-Holland (2005).
7. The Ellipsoid Algorithm and its Consequences in Combinatorial Optimization. Combinatorica, 1 (1981), 499-513.
8. Grötschel, M. Lovász, L.and Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag. (1988).
9. Iwata, S.. A Faster Scaling Algorithm for Minimizing Submodular Functions. SIAM J. on Computing 32 (2002) 833-840.
10. Iwata, S., Fleischer, L., and. Fujishige, S: A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions. J. ACM 48 (2001) 761-777.
11. Lovász, L.: Submodular Functions and Convexity. In Mathematical Programming - The State of the Art, A. Bachern, M. Grötschel, B. Korte eds., Springer, Berlin (1983) 235-257.
12. McCormick, S.T.: Submodular Function Minimization. In Discrete Optimization, K. Aardal, G. Nemhauser, and R. Weismantel, eds. Handbooks in Operations Research and Management Science, Volume 12. Elsevier. (2005).
13. Schrijver, A.: A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time. J. Combin. Theory Ser. B 80 (2000) 346-355.
14. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003).
15. Vygen, J.. A Note on Schrijver's Submodular Function Minimization Algorithm. Journal of Combinatorial Theory B 88 (2003) 399-402.