Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Improved balanced flow computation using parametric flow

From MaRDI portal
Publication:284342
Jump to:navigation, search

DOI10.1016/j.ipl.2016.04.008zbMath1361.91050arXiv1512.05974OpenAlexW2221924776MaRDI QIDQ284342

Omar Darwish, Kurt Mehlhorn

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


zbMATH Keywords

algorithmsmarket equilibriumnetwork flowbalanced flowparametric flow


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Special types of economic equilibria (91B52) Deterministic network models in operations research (90B10)


Related Items (3)

A note on balanced flows in equality networks ⋮ Ratio-balanced maximum flows ⋮ Unnamed Item



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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:284342&oldid=12168538"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 02:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki