Fairness in routing and load balancing
From MaRDI portal
Publication:5952449
DOI10.1006/jcss.2001.1752zbMath0996.68021OpenAlexW1980375431MaRDI QIDQ5952449
Éva Tardos, Yuval Rabani, Jon M. Kleinberg
Publication date: 27 February 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2001.1752
Related Items
Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis ⋮ Network QoS games: stability vs optimality tradeoff ⋮ Fairness in academic course timetabling ⋮ Simultaneously load balancing for every p-norm, with reassignments ⋮ Fair cost-sharing methods for the minimum spanning tree game ⋮ Max-min fairness in multi-commodity flows ⋮ Minimum edge ranking spanning trees of split graphs ⋮ Maximum Throughput Network Routing Subject to Fair Flow Allocation ⋮ Fair online load balancing ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ Fairness in maximal covering location problems ⋮ Fair resource allocation for different scenarios of demands ⋮ Simultaneous approximation of multi-criteria submodular function maximization ⋮ Equitable bandwidth allocation in content distribution networks ⋮ The efficiency of fair division ⋮ Pricing for fairness: distributed resource allocation for multiple objectives ⋮ A general branch-and-bound algorithm for fair division problems ⋮ Fair welfare maximization ⋮ Simultaneous approximation ratios for parallel machine scheduling problems ⋮ Price-based protocols for fair resource allocation ⋮ Fair optimization and networks: a survey ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines ⋮ Unnamed Item
Cites Work
