Bottleneck flows in unit capacity networks
From MaRDI portal
Publication:976109
DOI10.1016/j.ipl.2008.11.011zbMath1191.68453OpenAlexW2004865003MaRDI QIDQ976109
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
Related Items (1)
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A linear time algorithm for the maximum capacity path problem
- Solution structures and sensitivity of special assignment problems
- Stability in bottleneck path problems
- On the bottleneck linear programming problem
- A min-max problem as a linear programming problem
- Parallel algorithm to find maximum capacity paths
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Computing Euclidean bottleneck matchings in higher dimensions
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Trapezoidal matrices and the bottleneck assignment problem
- A fast algorithm for a class of bottleneck problems
- Mosaicking of Aerial Photographic Maps Via Seams Defined by Bottleneck Shortest Paths
- Fast, Fair, and Efficient Flows in Networks
- On three basic methods for solving bottleneck transportation problems
- Algorithms for two bottleneck optimization problems
- Bottleneck Linear Programming
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Network Flow and Testing Graph Connectivity
- Time‐minimizing transportation problems
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- Geometry helps in bottleneck matching and related problems
This page was built for publication: Bottleneck flows in unit capacity networks
