On \((1, \epsilon )\)-restricted max-min fair allocation problem

DOI10.1007/s00453-018-0407-8zbMath1393.68069OpenAlexW2557626533MaRDI QIDQ724228

Xiaowei Wu, T.-H. Hubert Chan, Zhihao Gavin Tang

Publication date: 25 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0407-8

zbMATH Keywords

integrality gaphypergraph matchingmax-min fair allocation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for scheduling unrelated parallel machines
• A condition for matchability in hypergraphs
• Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
• The Santa Claus problem
• Santa claus meets hypergraph matchings
• Approximation Algorithms for the Max-Min Allocation Problem
• Santa Claus Schedules Jobs on Unrelated Machines
• On Allocating Goods to Maximize Fairness
• On (1,∊)-Restricted Assignment Makespan Minimization
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• New Constructive Aspects of the Lovász Local Lemma

This page was built for publication: On \((1, \epsilon )\)-restricted max-min fair allocation problem