Article

Free access

Solving minimum-cost flow problems by successive approximation

Authors:

R. TarjanAuthors Info & Claims

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

Pages 7 - 18

https://doi.org/10.1145/28395.28397

Published: 01 January 1987 Publication History

Abstract

We introduce a framework for solving minimum-cost flow problems. Our approach measures the quality of a solution by the amount that the complementary slackness conditions are violated. We show how to extend techniques developed for the maximum flow problem to improve the quality of a solution. This framework allows us to achieve Ο(min(n³, n^5/3 m^2/3, nm log n) log (nC)) running time.

References

[1]

B. Awerbuch. Complexity of network synchronization. Journal of the A CM, 32:804-823, 1985.

Digital Library

[2]

C. A. B~tesox~. Perform~x~ce comparison of two algorithms for weighted bipartite matchings. 1985. M.S. thesis, University of Colorado, Boulder, Colorado.

[3]

D. P. Bertsekas. Distributed asynchronous relaxation methods for linear network flow problems. In Proc. ~Sth IEEE Conference on Decision and Control, Athens, Greece, 1986.

[4]

D. P. Bertsekas and P. Tseng. Relaxation methods for minimum cost ordinary and generalized network flow problems. O. R. Journal, 1986. (To a.ppear).

Digital Library

[5]

R. G. Bland and D. L. Jensen. On the Computational Behavior of a Polynomial-Time Network Flow Algorithm. Technical Report 661, School of Operations Research and Industrial Engineering, Cornell University, 1985.

[6]

E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Math. Dok., 11:1277-1280, 1970.

[7]

J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the A CM, 19:248-264, 1972.

Digital Library

[8]

L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton Univ. Press, Princeton, N J., 1962.

[9]

S. Fortune and J. Wyllie. Parallelisln in random access machines. In Proc. 10th A CM Syrup. on Theory of Computing, pages 114-118, 1978.

Digital Library

[10]

M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses. In Proc. 25th IEEE Syrnp. on Foundations of Computer Science, pages 338-346, 1984.

[11]

S. Fujishige. A capacity-ronnding X{gorithm for the minimum-cost circulation problem: a dual framework of the tardos algorithm. Math. Prog., 3;5:298-308, 1986.

Digital Library

[12]

D. R. Fulkerson. An out-of-kilter method for minireal cost flow problems. SIAM J. Appl. Math, 9:18-27, 1961.

[13]

H. N. Gabow. Scaling algorithms for network problems. J. o.{ Comp. and Sys. Sci., 31:148-168, 1985.

Digital Library

[14]

Z. Galil. An O(VS/aE2/a) algorithm for the maximal flow problem. Acta Informatica, 14:221-242, 1980.

Digital Library

[15]

Z. Galil. Personal communication. 1987.

[16]

Z.Galil. and E.Tardos An 0(n2hpoi poop opop ) min-cost flow algorithm. In Proc. ~7ttl IEEE Syrup. of Foundations of Computer Science, pages 1-9, 1986.

[17]

R. G. Gallager, P. A. Humblet, and P. M Spits. A distributed Mgorithm for minimum-weight spanning trees, A CM Transactions on Programming Languages and Systems, 5(1):66-77, 1983.

Digital Library

[18]

S. I. Gass. Linear Programming: Methods and Applications. McGraw-Hill, 1958.

Digital Library

[19]

A. ~. Goldberg. Efficient Graph Algorithms }or Sequential and Parallel Computers. PhD thesis, M.I.T., 1987.

[20]

A. V. Goldberg and R. E. Tarjan. A new approach to the maximum flow problem. In Proc.18th A CM Syrup. on Theor~t of Computing, pages 136-146, 1986.

Digital Library

[21]

A. V. Ka:rzanov. Determining the maximal flow in a network by the method of preflows. Soviet Math. Dok., 15:434-437, 1974.

[22]

E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Reinhart, and Winston, New York, NY., 1976.

[23]

C. Leiserson and B. M~ggs. Communication-effident parallel graph algorithms, in Proc. of International Conference on Parallel Processing, p~ges 861-868, 1986.

[24]

V. M. Malhotra, M. Pramodh Kumar, and S. N. Mah~shwa~i. A, o(IvP) algorithm for finding ma~ximum flows in networks, inform. Process. Lett., 7:277-278, 1978.

[25]

G. J. Minty. Monotone networks. Proc. Ro~t. Soc. London, A(257):194-212, 1960.

[26]

A. T. Ogielski. Integer optimization and zerotemperature fixed point in Ising random-field systems. Physical Review Lett., 57(10):1251-1254, 1986.

[27]

J. B. Orlin. Genuinely Polynomial Simplex and Non- Simplex Algorithms for the Minimum Cost Flow Problem. TechnicM Report No. 1615-84, Slosh School of Management, MIT, December 1984.

[28]

C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice- Hall, Englewood Cliffs, N J, 1982.

Digital Library

[29]

H. RSck. Scaling techniques for minimal cost network flows. In V. Page, editor, Discrete Structures and At. gorithms, C~rl Hansen, Munich, 1980.

[30]

Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. Journal of Algorithms, 3:57-67, 1982.

Digital Library

[31]

D. V. Sleator. An O(nmlogn) Algorithm for Maxi. mum Network Flow. Technical Report STAN-CS-80- 831, Computer Science Department, Stanford University, Stantbrd, CA, 1980.

[32]

D. D. Sleator and R. E. Tarjan. A data structure for dynamic trees. J. Comput. System Sci., 26:362-391, 1983.

Digital Library

[33]

D. D. Sleator and R. E. Tarjan. Self-adjusting binary. search trees. Journal of the ACM, 32:652-686, 1985.

Digital Library

[34]

E. Tardos. A strongly polynomial minimum cost circulation algorithm. Combinatorica, 5(3):247-255, 1985.

Digital Library

[35]

R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983,

Digital Library

[36]

R. E. Tarjan. A simple version of Karzanov's blocking flow algorithm. Operations Research Letters, 2:265- 268, 1984.

Digital Library

Cited By

Brand JChen LKyng RLiu YPeng RGutenberg MSachdeva SSidford A(2023)A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00037(503-514)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00037
Merkurjev E(2023)Similarity graph-based max-flow and duality approaches for semi-supervised data classification and image segmentationInternational Journal of Machine Learning and Cybernetics10.1007/s13042-023-01894-714:12(4285-4310)Online publication date: 21-Jun-2023
https://doi.org/10.1007/s13042-023-01894-7
Chen LKyng RLiu YPeng RGutenberg MSachdeva S(2022)Maximum Flow and Minimum-Cost Flow in Almost-Linear Time2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00064(612-623)Online publication date: Oct-2022
https://doi.org/10.1109/FOCS54457.2022.00064
Show More Cited By

Index Terms

Solving minimum-cost flow problems by successive approximation

Recommendations

Fast Approximation Algorithms for Multicommodity Flow Problems

All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms uses a fast matrix multiplication algorithm and takes O(k3.5n3m0.5 log(nDU)) time for the ...
Fast Approximation Algorithms for Multicommodity Flow Problems
Selected papers of the 23rd annual ACM symposium on Theory of computing

All previously known algorithms for solving the multicommodity flow problem with capacities are based on linear programming. The best of these algorithms uses a fast matrix multiplication algorithm and takes O(k3.5n3m0.5 log(nDU)) time for the ...
The amortized cost of finding the minimum
SODA '15: Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms

We obtain an essentially optimal tradeoff between the amortized cost of the three basic priority queue operations insert, delete and find-min in the comparison model. More specifically we show that

[EQUATION]

for any fixed ε > 0, where n is the number ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing

January 1987

471 pages

ISBN:0897912217

DOI:10.1145/28395

Editor:
Alfred V. Aho

Copyright © 1987 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1987

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC87

Sponsor:

SIGACT

STOC87: 19th Annual ACM Conference on Theory of Computing

New York, New York, USA

Acceptance Rates

STOC '87 Paper Acceptance Rate 50 of 165 submissions, 30%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

108
Total Citations
View Citations
3,527
Total Downloads

Downloads (Last 12 months)494
Downloads (Last 6 weeks)43

Reflects downloads up to 01 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Brand JChen LKyng RLiu YPeng RGutenberg MSachdeva SSidford A(2023)A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00037(503-514)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00037
Merkurjev E(2023)Similarity graph-based max-flow and duality approaches for semi-supervised data classification and image segmentationInternational Journal of Machine Learning and Cybernetics10.1007/s13042-023-01894-714:12(4285-4310)Online publication date: 21-Jun-2023
https://doi.org/10.1007/s13042-023-01894-7
Chen LKyng RLiu YPeng RGutenberg MSachdeva S(2022)Maximum Flow and Minimum-Cost Flow in Almost-Linear Time2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00064(612-623)Online publication date: Oct-2022
https://doi.org/10.1109/FOCS54457.2022.00064
Ma H(2022)Intelligent planning for large‐scale multi‐agent systemsAI Magazine10.1002/aaai.1206943:4(376-382)Online publication date: 11-Dec-2022
https://dl.acm.org/doi/10.1002/aaai.12069
Salvado JMansouri MPecora F(2021)A Network-Flow Reduction for the Multi-Robot Goal Allocation and Motion Planning Problem2021 IEEE 17th International Conference on Automation Science and Engineering (CASE)10.1109/CASE49439.2021.9551640(2194-2201)Online publication date: 23-Aug-2021
https://dl.acm.org/doi/10.1109/CASE49439.2021.9551640
Vishnoi N(2021)Algorithms for Convex Optimization10.1017/9781108699211Online publication date: 24-Sep-2021
https://doi.org/10.1017/9781108699211
Sirina NYushkova S(2020)Integrative management of infrastructure and traction equipment at the railway areaVestnik of the Railway Research Institute10.21780/2223-9731-2019-78-6-328-33978:6(328-339)Online publication date: 4-Jan-2020
https://doi.org/10.21780/2223-9731-2019-78-6-328-339
Shabunin ATakmazian AEsakov A(2020)A Shift-Daily Planning of Freight Trains Composition and Transit Using Maximum Network Flow Approach2020 International Russian Automation Conference (RusAutoCon)10.1109/RusAutoCon49822.2020.9208145(1101-1106)Online publication date: Sep-2020
https://doi.org/10.1109/RusAutoCon49822.2020.9208145
Cho HEaswaran A(2020)Flow Network Models for Online Scheduling Real-Time Tasks on MultiprocessorsIEEE Access10.1109/ACCESS.2020.30246928(172136-172151)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3024692
Jiang JChen JWang C(2020)Multi-granularity hybrid parallel network simplex algorithm for minimum-cost flow problemsThe Journal of Supercomputing10.1007/s11227-020-03227-9Online publication date: 4-Mar-2020
https://doi.org/10.1007/s11227-020-03227-9
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents