A fast maximum flow algorithm
© 2020 Wiley Periodicals LLC. In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021
|
| Online Access: | https://hdl.handle.net/1721.1/134021 |
| _version_ | 1826211437707526144 |
|---|---|
| author | Orlin, James B Gong, Xiao-yue |
| author2 | Sloan School of Management |
| author_facet | Sloan School of Management Orlin, James B Gong, Xiao-yue |
| author_sort | Orlin, James B |
| collection | MIT |
| description | © 2020 Wiley Periodicals LLC. In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan. We describe a new variant of the excess scaling algorithm for the max flow problem whose running time strictly dominates the running time of the algorithm by King et al. For graphs in which m = O(nlog n), the running time of our algorithm dominates that of King et al. by a factor of O(loglog n). Moreover, our algorithm achieves this improved performance without reliance on dynamic trees. |
| first_indexed | 2024-09-23T15:06:10Z |
| format | Article |
| id | mit-1721.1/134021 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T15:06:10Z |
| publishDate | 2021 |
| publisher | Wiley |
| record_format | dspace |
| spelling | mit-1721.1/1340212023-12-14T15:50:28Z A fast maximum flow algorithm Orlin, James B Gong, Xiao-yue Sloan School of Management © 2020 Wiley Periodicals LLC. In 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan. We describe a new variant of the excess scaling algorithm for the max flow problem whose running time strictly dominates the running time of the algorithm by King et al. For graphs in which m = O(nlog n), the running time of our algorithm dominates that of King et al. by a factor of O(loglog n). Moreover, our algorithm achieves this improved performance without reliance on dynamic trees. 2021-10-27T19:57:40Z 2021-10-27T19:57:40Z 2021 2021-04-01T14:12:09Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/134021 en 10.1002/net.22001 Networks Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Wiley arXiv |
| spellingShingle | Orlin, James B Gong, Xiao-yue A fast maximum flow algorithm |
| title | A fast maximum flow algorithm |
| title_full | A fast maximum flow algorithm |
| title_fullStr | A fast maximum flow algorithm |
| title_full_unstemmed | A fast maximum flow algorithm |
| title_short | A fast maximum flow algorithm |
| title_sort | fast maximum flow algorithm |
| url | https://hdl.handle.net/1721.1/134021 |
| work_keys_str_mv | AT orlinjamesb afastmaximumflowalgorithm AT gongxiaoyue afastmaximumflowalgorithm AT orlinjamesb fastmaximumflowalgorithm AT gongxiaoyue fastmaximumflowalgorithm |