An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem
From MaRDI portal
Publication:651729
DOI10.1016/j.apm.2011.04.027zbMath1228.90016OpenAlexW2049971620MaRDI QIDQ651729
Publication date: 18 December 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.04.027
Analysis of algorithms (68W40) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new algorithm for solving the feasibility problem of a network flow
- Scaling algorithms for network problems
- Computing maximum mean cuts
- A data structure for dynamic trees
- A new approach for computing a most positive cut using the minimum flow algorithms
- Beyond the flow decomposition barrier
- A new approach to the maximum-flow problem
- Improved Time Bounds for the Maximum Flow Problem
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm
- A Faster Deterministic Maximum Flow Algorithm
- Online load balancing and network flow
This page was built for publication: An \(O(mn \log (nU))\) time algorithm to solve the feasibility problem