Why locally-fair maximal flows in client-server networks perform well
From MaRDI portal
Publication:652641
DOI10.1007/s10878-010-9321-yzbMath1230.90044OpenAlexW2051323846MaRDI QIDQ652641
Kenneth A. Berman, Chad Yoshikawa
Publication date: 15 December 2011
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9321-y
Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cites Work
This page was built for publication: Why locally-fair maximal flows in client-server networks perform well