Minimum-cost flows in unit-capacity networks
type: Item
instance of: scholarly article
title: Minimum-cost flows in unit-capacity networks
zbMATH Open document ID: 1379.05049
author: Andrew V. Goldberg
author: Sagi Hed
author: Haim Kaplan
author: Robert E. Tarjan
published in: Theory of Computing Systems
publication date: 2018-02-01T00:00:00Z
Mathematics Subject Classification ID: 05C21
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C82
zbMATH DE Number: 6833237
zbMATH Keywords: algorithms
zbMATH Keywords: minimum-cost flows
zbMATH Keywords: bipartite matching
zbMATH Keywords: assignment problem
MaRDI profile type: Publication
full work available at URL: s00224-017-9776-7
OpenAlex ID: W2614327298
cites work: Finding minimum-cost flows by double scaling
cites work: Q3056948
cites work: Global Price Updates Help
cites work: On the computational behavior of a polynomial-time network flow algorithm
cites work: Buckets, Heaps, Lists, and Monotone Priority Queues
cites work: Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ (m10/7 log W) Time (Extended Abstract)
cites work: Q3549731
cites work: Network Flow and Testing Graph Connectivity
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Scaling algorithms for network problems
cites work: Faster Scaling Algorithms for Network Problems
cites work: Scaling Algorithms for the Shortest Paths Problem
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q3048571
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: Q3908745
cites work: A strongly polynomial minimum cost circulation algorithm
DOI: 10.1007/S00224-017-9776-7
Recommended article: Q4900326
Recommended article: Q3693221
Recommended article: Q2955012
Recommended article: Min-cost multiflows in node-capacitated undirected networks
Recommended article: Q3127237
Recommended article: Minimum cost multiflows in undirected networks
Recommended article: Min-Cost Flow in Unit-Capacity Planar Graphs
Recommended article: Q4973720
Recommended article: Q3626256
Recommended article: Minimum Convex Cost Dynamic Network Flows
description: scientific article; zbMATH DE number 6833237