Combining fairness with throughput: Online routing with multiple objectives
From MaRDI portal
Publication:5952452
DOI10.1006/JCSS.2001.1755zbMATH Open0984.68004OpenAlexW2021474514MaRDI QIDQ5952452FDOQ5952452
Ashish Goel, Serge Plotkin, Adam Meyerson
Publication date: 14 May 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1ea27af011bd09ce990471f06df0b17d0d4b9eb3
Cites Work
Cited In (12)
- Price-based protocols for fair resource allocation
- Fair online load balancing
- Fair Dynamic Routing in Large-Scale Heterogeneous-Server Systems
- Simultaneous approximation ratios for parallel machine scheduling problems
- Title not available (Why is that?)
- Fairness in routing and load balancing
- Bicriteria Online Matching: Maximizing Weight and Cardinality
- Fair resource allocation for different scenarios of demands
- An online throughput-competitive algorithm for multicast routing and admission control
- Simultaneous approximation of multi-criteria submodular function maximization
- Fair and efficient allocation with few agent types, few item types, or small value levels
- Pricing for fairness: distributed resource allocation for multiple objectives
Recommendations
This page was built for publication: Combining fairness with throughput: Online routing with multiple objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952452)