Bottleneck flows in unit capacity networks

DOI10.1016/J.IPL.2008.11.011MaRDI QIDQ976109zbMATH OpenOpenAlexFDO

Authors Abraham P. Punnen, Ruonan Zhang

Publication date 16 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.11.011

zbMATH Keywords

algorithmsgraphsnetwork flowscombinatorial problemsminimum cost flowunit capacity

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Nonnumerical algorithms (68W05)

Recommendations

• Flows in Undirected Unit Capacity Networks
• Minimum flows in unit capacity networks
• scientific article; zbMATH DE number 4085386
• scientific article; zbMATH DE number 4046840
• scientific article; zbMATH DE number 3978784
• On the bottleneck capacity expansion problems on networks
• scientific article; zbMATH DE number 3976731
• Flows in dynamic networks with aggregate arc capacities
• The Constrained Bottleneck Problem in Networks
• scientific article; zbMATH DE number 4041594

Cites work

• scientific article; zbMATH DE number 5485494 (Why is no real title available?)
• scientific article; zbMATH DE number 3731748 (Why is no real title available?)
• A fast algorithm for a class of bottleneck problems
• A linear time algorithm for the maximum capacity path problem
• A min-max problem as a linear programming problem
• A note on two problems in connexion with graphs
• Algorithms for two bottleneck optimization problems
• All-pairs bottleneck paths in vertex weighted graphs
• Bottleneck Linear Programming
• Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
• Computing Euclidean bottleneck matchings in higher dimensions
• Fast, Fair, and Efficient Flows in Networks
• Geometry helps in bottleneck matching and related problems
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths
• Network Flow and Testing Graph Connectivity
• Network flows. Theory, algorithms, and applications.
• On the bottleneck linear programming problem
• On three basic methods for solving bottleneck transportation problems
• Parallel algorithm to find maximum capacity paths
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• Solution methods and computational investigations for the linear bottleneck assignment problem
• Solution structures and sensitivity of special assignment problems
• Stability in bottleneck path problems
• Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Time‐minimizing transportation problems
• Trapezoidal matrices and the bottleneck assignment problem

Cited in

(8)

• scientific article; zbMATH DE number 3978784 (Why is no real title available?)
• The Constrained Bottleneck Problem in Networks
• Source sink flows with capacity installation in batches
• Single-source bottleneck path algorithm faster than sorting for sparse graphs
• Maximal flow network modelling of production bottleneck problems
• Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
• On efficient algorithms for bottleneck path problems with many sources
• Flows in Undirected Unit Capacity Networks

This page was built for publication: Bottleneck flows in unit capacity networks

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