Simplifications and speedups of the pseudoflow algorithm

DOI10.1002/NET.21467MaRDI QIDQ5326778zbMATH OpenOpenAlexWikidataFDO

Authors Dorit S. Hochbaum, James B. Orlin

Publication date 6 August 2013

Published in Networks (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1721.1/77228

zbMATH Keywords

data structuremaximum flowminimum cutdynamic treespseudoflow algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Data structures (68P05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• Publication:3840369
• An $o(n^3 )$-Time Maximum-Flow Algorithm
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• A new approach to the maximum-flow problem

Cites work

• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• A Faster Deterministic Maximum Flow Algorithm
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• A data structure for dynamic trees
• A new approach to the maximum-flow problem
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Beyond the flow decomposition barrier
• Computational investigations of maximum flow algorithms
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Maximal Flow Through a Network
• Network flows. Theory, algorithms, and applications.
• On implementing the push-relabel method for the maximum flow problem
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem

Cited in

(9)

• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems
• A direct block scheduling model considering operational space requirement for strategic open-pit mine production planning
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• Enhanced instance space analysis for the maximum flow problem
• Implementing the Ford-Fulkerson labeling algorithm with fixed-order scanning
• scientific article; zbMATH DE number 1187162 (Why is no real title available?)
• A recursive time aggregation-disaggregation heuristic for the multidimensional and multiperiod precedence-constrained knapsack problem: an application to the open-pit mine block sequencing problem
• On the impact of initialisation strategies on maximum flow algorithm performance

Describes a project that uses

Uses Software

• MAXFLOW
• DIMACS

This page was built for publication: Simplifications and speedups of the pseudoflow algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326778)