Skip to main content
SpringerLink
Log in

A Faster Scaling Algorithm for Minimizing Submodular Functions

  • Conference paper
  • First Online:
Integer Programming and Combinatorial Optimization (IPCO 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2337))

Abstract

Combinatorial strongly polynomial algorithms for minimizing submodular functions have been developed by Iwata, Fleischer, and Fujishige (IFF) and by Schrijver. The IFF algorithm employs a scaling scheme for submodular functions, whereas Schrijver’s algorithm exploits distance labeling. This paper combines these two techniques to yield a faster combinatorial algorithm for submodular function minimization. The resulting algorithm improves over the previously best known bound by an almost linear factor in the size of the underlying ground set.

This research is supported in part by a Grant-in-Aid for Scientific Research of the Ministry of Education, Science, Sports and Culture of Japan.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. H. Cunningham: Testing membership in matroid polyhedra. J. Combinatorial Theory, Ser. B, 36 (1984) 161–188.

    Article  MathSciNet  MATH  Google Scholar 

  2. W. H. Cunningham: On submodular function minimization. Combinatorica 5 (1985) 185–192.

    Article  MathSciNet  MATH  Google Scholar 

  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.

    Google Scholar 

  4. L. Fleischer and S. Iwata: A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Appl. Math., to appear.

    Google Scholar 

  5. L. Fleischer, S. Iwata, and S. T. McCormick: A faster capacity scaling algorithm for submodular flow. Math. Programming, to appear.

    Google Scholar 

  6. S. Fujishige: Submodular Functions and Optimization, North-Holland, 1991.

    Google Scholar 

  7. M. Grötschel, L. Lovász, and A. Schrijver: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169–197.

    Article  MathSciNet  MATH  Google Scholar 

  8. M. Grötschel, L. Lovász, and A. Schrijver: Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, 1988.

    Google Scholar 

  9. S. Iwata: A capacity scaling algorithm for convex cost submodular flows. Math. Programming 76 (1997) 299–308.

    MathSciNet  MATH  Google Scholar 

  10. S. Iwata: A fully combinatorial algorithm for submodular function minimization. J. Combinatorial Theory, Ser. B, to appear.

    Google Scholar 

  11. S. Iwata, L. Fleischer, and S. Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48 (2001) 761–777.

    Article  MathSciNet  MATH  Google Scholar 

  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.

    Google Scholar 

  13. A. Schrijver: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combinatorial Theory, Ser. B, 80 (2000) 346–355.

    Article  MathSciNet  MATH  Google Scholar 

  14. L. S. Shapley: Cores of convex games. Int. J. Game Theory 1 (1971) 11–26.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Informatics, University of Tokyo, Tokyo, 113-0033, Japan

    Satoru Iwata

Authors
  1. Satoru Iwata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Program in Applied and Computational Mathematics, University of Princeton, Fine Hall, Washington Road, Princeton, NJ, 08544-1000, USA

    William J. Cook

  2. Sloan School of Management, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA, 02139-4307, USA

    Andreas S. Schulz

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iwata, S. (2002). A Faster Scaling Algorithm for Minimizing Submodular Functions. In: Cook, W.J., Schulz, A.S. (eds) Integer Programming and Combinatorial Optimization. IPCO 2002. Lecture Notes in Computer Science, vol 2337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47867-1_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-47867-1_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43676-8

  • Online ISBN: 978-3-540-47867-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation