Skip to main content
SpringerLink
Log in

A capacity scaling algorithm for M-convex submodular flow

  • Published:
Mathematical Programming Submit manuscript

Abstract.

This paper presents a faster algorithm for the M-convex submodular flow problem, which is a generalization of the minimum-cost flow problem with an M-convex cost function for the flow-boundary, where an M-convex function is a nonlinear nonseparable discrete convex function on integer points. The algorithm extends the capacity scaling approach for the submodular flow problem by Fleischer, Iwata and McCormick (2002) with the aid of a novel technique of changing the potential by solving maximum submodular flow problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahuja, R.K., Hochbaum, D.S., Orlin, J.B.: Solving the convex cost integer dual network flow problem. Manage. Sci. 49, 950–964 (2003)

    Article  Google Scholar 

  2. Cunningham, W.H., Frank, A.: A primal-dual algorithm for submodular flows. Math. Oper. Res. 10, 251–262 (1985)

    MATH  MathSciNet  Google Scholar 

  3. Dress, A.W.M., Wenzel, W.: Valuated matroids. Adv. Math. 93, 214–250 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  4. Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1, 185–204 (1977)

    Article  MathSciNet  Google Scholar 

  5. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19, 248–264 (1972)

    Article  MATH  Google Scholar 

  6. Fleischer, L., Iwata, S., McCormick, S.T.: A faster capacity scaling algorithm for minimum cost submodular flow. Math. Program. Ser. A 92, 119–139 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Frank, A.: Finding feasible vectors of Edmonds-Giles polyhedra. J. Comb. Theory, Ser. B 36, 221–239 (1984)

    MATH  Google Scholar 

  8. Fujishige, S.: Algorithms for solving the independent flow-problems. J. Oper. Res. Soc. Japan 21, 189–204 (1978)

    MATH  MathSciNet  Google Scholar 

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

  10. Fujishige, S., Zhang, X.: New algorithms for the intersection problem of submodular systems. Japan J. Indust. Appl. Math. 9, 369–382 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hochbaum, D.S.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. 19, 390–409 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hochbaum, D.S.: An efficient algorithm for image segmentation, Markov random fields and related problems. J. ACM 48, 686–701 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hochbaum, D.S., Queyranne, M.: Minimizing a convex cost closure set. SIAM J. Discrete Math. 16, 192–207 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. Iwata, S.: A faster scaling algorithm for minimizing submodular functions. SIAM J. Comput. 32, 833–840 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. Iwata, S., McCormick, S.T., Shigeno, M.: A strongly polynomial cut canceling algorithm for the submodular flow problem. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds), Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 1610, pp. 259–272 Springer-Verlag 1999

  18. Iwata, S., Shigeno, M.: Conjugate scaling algorithm for Fenchel-type duality in discrete convex optimization. SIAM J. Optim. 13, 204–211 (2003)

    Article  MathSciNet  Google Scholar 

  19. Lovász, L.: Submodular functions and convexity. In: Bachem, A., Grötschel, M., Korte, B. (eds), Mathematical Programming –- The State of the Art, pp. 235–257 Springer-Verlag 1983

  20. Moriguchi, S., Murota, K.: Capacity scaling algorithm for scalable M-convex submodular flow problems. Optim. Methods Softw. 18, 207–218 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  21. Murota, K.: Valuated matroid intersection, I: optimality criteria. SIAM J. Discrete Math. 9, 545–561 (1996)

    MATH  MathSciNet  Google Scholar 

  22. Murota, K.: Valuated matroid intersection, II: algorithms. SIAM J. Discrete Math. 9, 562–576 (1996)

    MATH  MathSciNet  Google Scholar 

  23. Murota, K.: Convexity and Steinitz’s exchange property. Adv. Math. 124, 272–311 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  24. Murota, K.: Discrete convex analysis. Math. Program. 83, 313–371 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  25. Murota, K.: Submodular flow problem with a nonseparable cost function. Combinatorica 19, 87–109 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  26. Murota, K.: Discrete Convex Analysis. SIAM, Philadelphia 2003

  27. Murota, K., Tamura, A.: Application of M-convex submodular flow problem to mathematical economics. Japan J. Indust. Appl. Math. 20, 257–277 (2003)

    MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  29. Shioura, A.: Fast scaling algorithms for M-convex function minimization with application to resource allocation problem. Discrete Appl. Math. 134, 303–316 (2003)

    Article  MathSciNet  Google Scholar 

  30. Tamura, A.: Coordinatewise domain scaling algorithm for M-convex function minimization. Math. Program., to appear

  31. Tardos, É., Tovey, C.A., Trick, M.A.: Layered augmenting path algorithms. Math. Oper. Res. 11, 362–370 (1986)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, University of Tokyo, Tokyo, 113-8656, Japan

    Satoru Iwata

  2. CREST, Japan Science and Technology Agency, Saitama, 332-0012, Japan

    Satoko Moriguchi

  3. Graduate School of Information Science and Technology, University of Tokyo, Tokyo, 113-8656, Japan

    Kazuo Murota

  4. PRESTO JST,  

    Kazuo Murota

Authors
  1. Satoru Iwata
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Satoko Moriguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kazuo Murota
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Satoko Moriguchi.

Additional information

Mathematics Subject Classification (1991): 90C27

A preliminary version of this paper has appeared in Proceedings of the Tenth International Conference on Integer Programming and Combinatorial Optimization (IPCO X), LNCS 3064, Springer-Verlag, 2004, pp. 352–367.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iwata, S., Moriguchi, S. & Murota, K. A capacity scaling algorithm for M-convex submodular flow. Math. Program. 103, 181–202 (2005). https://doi.org/10.1007/s10107-004-0562-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-004-0562-3

Keywords

Search

Navigation