General max-min fair allocation

DOI10.1007/978-3-030-89543-3_6OpenAlexW3211270796MaRDI QIDQ2695275

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

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal semi-online preemptive algorithms for machine covering on two uniform machines
• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• The Santa Claus problem
• Santa claus meets hypergraph matchings
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• A new approximation technique for resource‐allocation problems
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• Restricted Max-Min Fair Allocation
• A Tale of Santa Claus, Hypergraphs and Matroids
• On Allocating Goods to Maximize Fairness

This page was built for publication: General max-min fair allocation