A combinatorial strongly polynomial algorithm for minimizing submodular functions

  title={A combinatorial strongly polynomial algorithm for minimizing submodular functions},
  author={Satoru Iwata and Lisa Fleischer and Satoru Fujishige},
  journal={J. ACM},
This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting algorithm runs in time bounded by a polynomial in the size of the underlying set and the length of the largest absolute function value. The paper… CONTINUE READING
Highly Influential
This paper has highly influenced 25 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 414 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
257 Citations
9 References
Similar Papers


Publications citing this paper.

414 Citations

Citations per Year
Semantic Scholar estimates that this publication has 414 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

and A

  • M. Grötschel, L. Lovász
  • Schrijver: Geometric Algorithms and Combinatorial…
  • 1988
Highly Influential
11 Excerpts

Tardos: An application of simultaneous Diophantine approximation in combinatorial optimization, Combinatorica

  • É.A. Frank
  • 1987
Highly Influential
6 Excerpts

and S

  • L. Fleischer, S. Iwata
  • T. McCormick: A faster capacity scaling algorithm…
  • 1999
Highly Influential
3 Excerpts

A rounding technique for the polymatroid membership problem

  • H. Narayanan
  • Linear Algebra Appl.,
  • 1995
Highly Influential
4 Excerpts

Submodular systems and related topics, Math

  • S. Fujishige
  • Programming Study,
  • 1984
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…