Bottleneck flows in unit capacity networks
type: Item
instance of: scholarly article
title: Bottleneck flows in unit capacity networks
zbMATH Open document ID: 1191.68453
author: Abraham P. Punnen
author: Ruonan Zhang
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5721997
zbMATH Keywords: algorithms
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graphs
zbMATH Keywords: network flows
zbMATH Keywords: minimum cost flow
zbMATH Keywords: unit capacity
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.11.011
OpenAlex ID: W2004865003
cites work: Q3056948
cites work: Trapezoidal matrices and the bottleneck assignment problem
cites work: Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
cites work: Fast, Fair, and Efficient Flows in Networks
cites work: On three basic methods for solving bottleneck transportation problems
cites work: A note on two problems in connexion with graphs
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Computing Euclidean bottleneck matchings in higher dimensions
cites work: Solution structures and sensitivity of special assignment problems
cites work: Network Flow and Testing Graph Connectivity
cites work: Bottleneck Linear Programming
cites work: Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths
cites work: Algorithms for two bottleneck optimization problems
cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
cites work: Stability in bottleneck path problems
cites work: A min-max problem as a linear programming problem
cites work: Time‐minimizing transportation problems
cites work: Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
cites work: Geometry helps in bottleneck matching and related problems
cites work: Parallel algorithm to find maximum capacity paths
cites work: Solution methods and computational investigations for the linear bottleneck assignment problem
cites work: A linear time algorithm for the maximum capacity path problem
cites work: A fast algorithm for a class of bottleneck problems
cites work: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
cites work: On the bottleneck linear programming problem
cites work: Q2934690
cites work: Q3549658
cites work: Q3919445
DOI: 10.1016/J.IPL.2008.11.011
Recommended article: Flows in Undirected Unit Capacity Networks
Recommended article: Q4900326
Recommended article: Q3815106
Recommended article: Q3784953
Recommended article: Q3743072
Recommended article: On the bottleneck capacity expansion problems on networks
Recommended article: Q3741366
Recommended article: Flows in dynamic networks with aggregate arc capacities
Recommended article: The Constrained Bottleneck Problem in Networks
Recommended article: Q3779971
description: scientific article; zbMATH DE number 5721997