General max-min fair allocation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5485443 (Why is no real title available?)
- scientific article; zbMATH DE number 1182760 (Why is no real title available?)
- scientific article; zbMATH DE number 7561531 (Why is no real title available?)
- A Tale of Santa Claus, Hypergraphs and Matroids
- A new approximation technique for resource-allocation problems
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Combinatorial algorithm for restricted max-min fair allocation
- 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 Fair Allocation
- Santa claus meets hypergraph matchings
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- The Santa Claus problem
- The exact LPT-bound for maximizing the minimum completion time
Cited in
(3)
This page was built for publication: General max-min fair allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695275)