Simplifications and speedups of the pseudoflow algorithm
The pseudoflow algorithm for solving the maximum flow and minimum cut problems was devised in Hochbaum (2008). The complexity of the algorithm was shown in (2008) to be O(nm log n). Chandran and Hochbaum, (2009) demonstrated that the pseudoflow algorithm is very efficient in practice, and that the h...
Main Authors: | Hochbaum, Dorit S., Orlin, James B. |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | en_US |
Published: |
Wiley Blackwell
2013
|
Online Access: | http://hdl.handle.net/1721.1/77228 https://orcid.org/0000-0002-7488-094X |
Similar Items
-
Approximation algorithms for NP-hard problems /
by: Hochbaum, Dorit (Dorit S.)
Published: (1997) -
Quantum speedup of branch-and-bound algorithms
by: Ashley Montanaro
Published: (2020-01-01) -
Speedup of the quantum adiabatic algorithm using delocalization catalysis
by: Chenfeng Cao, et al.
Published: (2021-01-01) -
The need for structure in quantum speedups
by: Aaronson, Scott, et al.
Published: (2012) -
The Elusive Source of Quantum Speedup
by: Vedral, V
Published: (2010)