Improved balanced flow computation using parametric flow
From MaRDI portal
Publication:284342
DOI10.1016/j.ipl.2016.04.008zbMath1361.91050arXiv1512.05974OpenAlexW2221924776MaRDI QIDQ284342
Publication date: 18 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05974
Analysis of algorithms and problem complexity (68Q25) Special types of economic equilibria (91B52) Deterministic network models in operations research (90B10)
Related Items (3)
Cites Work
- A combinatorial polynomial algorithm for the linear Arrow-Debreu market
- Market equilibrium via a primal--dual algorithm for a convex program
- A new approach to the maximum-flow problem
- A Faster Deterministic Maximum Flow Algorithm
- An Improved Combinatorial Polynomial Algorithm for the Linear Arrow-Debreu Market
- A Fast Parametric Maximum Flow Algorithm and Applications
- A Randomized Maximum-Flow Algorithm
- Max flows in O(nm) time, or better
- Existence of an Equilibrium for a Competitive Economy
This page was built for publication: Improved balanced flow computation using parametric flow