IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v47y2000i6p511-520.html
   My bibliography  Save this article

A O(nm log(U/n)) time maximum flow algorithm

Author

Listed:
  • Antonio Sedeño‐Noda
  • Carlos González‐Martín

Abstract

In this paper, we present an O(nm log(U/n)) time maximum flow algorithm. If U = O(n) then this algorithm runs in O(nm) time for all values of m and n. This gives the best available running time to solve maximum flow problems satisfying U = O(n). Furthermore, for unit capacity networks the algorithm runs in O(n2/3m) time. It is a two‐phase capacity scaling algorithm that is easy to implement and does not use complex data structures. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 511–520, 2000

Suggested Citation

  • Antonio Sedeño‐Noda & Carlos González‐Martín, 2000. "A O(nm log(U/n)) time maximum flow algorithm," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(6), pages 511-520, September.
    • Handle: RePEc:wly:navres:v:47:y:2000:i:6:p:511-520
    DOI: 10.1002/1520-6750(200009)47:63.0.CO;2-S
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(200009)47:63.0.CO;2-S
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(200009)47:63.0.CO;2-S?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. R. K. Ahuja & James B. Orlin, 1989. "A Fast and Simple Algorithm for the Maximum Flow Problem," Operations Research, INFORMS, vol. 37(5), pages 748-759, October.
    2. Ravindra K. Ahuja & James B. Orlin, 1991. "Distance‐directed augmenting path algorithms for maximum flow and parametric maximum flow problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 413-430, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahuja, Ravindra K. & Kodialam, Murali & Mishra, Ajay K. & Orlin, James B., 1997. "Computational investigations of maximum flow algorithms," European Journal of Operational Research, Elsevier, vol. 97(3), pages 509-542, March.
    2. Sedeño-Noda, A. & González-Dávila, E. & González-Martín, C. & González-Yanes, A., 2009. "Preemptive benchmarking problem: An approach for official statistics in small areas," European Journal of Operational Research, Elsevier, vol. 196(1), pages 360-369, July.
    3. Huynh Tuong, Nguyen & Soukhal, Ameur, 2010. "Due dates assignment and JIT scheduling with equal-size jobs," European Journal of Operational Research, Elsevier, vol. 205(2), pages 280-289, September.
    4. Dorit S. Hochbaum & Anna Chen, 2000. "Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem," Operations Research, INFORMS, vol. 48(6), pages 894-914, December.
    5. E. M. U. S. B. Ekanayake & W. B. Daundasekara & S. P. C. Perera, 2022. "New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems," Modern Applied Science, Canadian Center of Science and Education, vol. 16(1), pages 1-30, February.
    6. Gary R. Waissi, 1993. "A new polynomial algorithm for maximum value flow with an efficient parallel implementation," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 393-414, April.
    7. Ahuja, Ravindra K., 1956-, 1995. "Computational investigations of maximum flow algorithms," Working papers 3811-95., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    8. Ravindra K. Ahuja & James B. Orlin, 1991. "Distance‐directed augmenting path algorithms for maximum flow and parametric maximum flow problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 413-430, June.
    9. A. Sedeño-Noda & M. González-Sierra & C. González-Martín, 2000. "An algorithmic study of the Maximum Flow problem: A comparative statistical analysis," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(1), pages 135-162, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:47:y:2000:i:6:p:511-520. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.