Bottleneck flows in unit capacity networks
From MaRDI portal
Publication:976109
DOI10.1016/J.IPL.2008.11.011zbMATH Open1191.68453OpenAlexW2004865003MaRDI QIDQ976109FDOQ976109
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
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
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- Network Flow and Testing Graph Connectivity
- Bottleneck Linear Programming
- Time‐minimizing transportation problems
- Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem”
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- A fast algorithm for a class of bottleneck problems
- Title not available (Why is that?)
- Algorithms for two bottleneck optimization problems
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
- Geometry helps in bottleneck matching and related problems
- Fast, Fair, and Efficient Flows in Networks
- A linear time algorithm for the maximum capacity path problem
- All-pairs bottleneck paths in vertex weighted graphs
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Parallel algorithm to find maximum capacity paths
- Computing Euclidean bottleneck matchings in higher dimensions
- 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
- Trapezoidal matrices and the bottleneck assignment problem
- Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths
- On three basic methods for solving bottleneck transportation problems
- Title not available (Why is that?)
Cited In (8)
- 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
- On efficient algorithms for bottleneck path problems with many sources
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Flows in Undirected Unit Capacity Networks
- Title not available (Why is that?)
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)
