General max-min fair allocation

DOI10.1007/978-3-030-89543-3_6MaRDI QIDQ2695275zbMATH OpenOpenAlexFDO

Authors Sheng-Yen Ko, Ho-Lin Chen, Siu-Wing Cheng, Wing-Kai Hon, Chung-Shou Liao

Publication date 30 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-89543-3_6

zbMATH Keywords

approximation algorithmshypergraph matchingmax-min allocation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

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)

• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• Restricted Max-Min Fair Allocation
• Maximin fairness in project budget allocation

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)