Parallel algorithms for the assignment and minimum-cost flow problems

DOI10.1016/0167-6377(93)90068-RzbMath0798.90043OpenAlexW2118684575WikidataQ59592645 ScholiaQ59592645MaRDI QIDQ1319670

James B. Orlin, Clifford Stein

Publication date: 12 April 1994

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(93)90068-r

zbMATH Keywords

scalingparallel algorithmassignment problembipartite matchingminimum-cost flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)

Related Items

Derandomizing Isolation in Space-Bounded Settings, A fast parallel algorithm for minimum-cost small integral flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scaling algorithms for network problems
• Matching is as easy as matrix inversion
• Constructing a perfect matching is in random NC
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Faster Scaling Algorithms for Network Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Parallelism in random access machines