Upward Max-Min Fairness

DOI10.1145/3011282zbMath1426.90243OpenAlexW2603892089MaRDI QIDQ3177883

Emilie Danna, Yishay Mansour, Danny Raz, Avinatan Hassidim, Haim Kaplan, Alok Kumar, Michal Segalov

Publication date: 2 August 2018

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3011282

zbMATH Keywords

multicommodity flowmax-min fairnessiterative exhaustive waterfillupward max-min fair multicommodity flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Distributed algorithms (68W15)

Related Items (2)

Maximum Throughput Network Routing Subject to Fair Flow Allocation ⋮ On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem

This page was built for publication: Upward Max-Min Fairness