Polynomial-time combinatorial algorithm for general max-min fair allocation
From MaRDI portal
Cites work
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem
- A new approximation technique for resource-allocation problems
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A Tale of Santa Claus, Hypergraphs and Matroids
- Approximation algorithms for scheduling unrelated parallel machines
- Combinatorial algorithm for restricted max-min fair allocation
- Fair resource allocation for different scenarios of demands
- Fair resource allocation: using welfare-based dominance constraints
- scientific article; zbMATH DE number 5485443 (Why is no real title available?)
- scientific article; zbMATH DE number 1182760 (Why is no real title available?)
- On allocating goods to maximize fairness
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Ordinal on-line scheduling for maximizing the minimum machine completion time
- Restricted max-min allocation: approximation and integrality gap
- Restricted max-min allocation: integrality gap and approximation algorithm
- Restricted Max-Min Fair Allocation
- Santa claus meets hypergraph matchings
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- The exact LPT-bound for maximizing the minimum completion time
- The Santa Claus problem
This page was built for publication: Polynomial-time combinatorial algorithm for general max-min fair allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182677)
