On \((1, \epsilon )\)-restricted max-min fair allocation problem
type: Item
instance of: scholarly article
title: On \((1, \epsilon )\)-restricted max-min fair allocation problem
zbMATH Open document ID: 1393.68069
author: T.-H. Hubert Chan
author: Zhihao Gavin Tang
author: Xiaowei Wu
published in: Algorithmica
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 91B32
zbMATH DE Number: 6910201
zbMATH Keywords: max-min fair allocation
zbMATH Keywords: hypergraph matching
zbMATH Keywords: integrality gap
MaRDI profile type: Publication
full work available at URL: s00453-018-0407-8
OpenAlex ID: W2557626533
cites work: Combinatorial Algorithm for Restricted Max-Min Fair Allocation
cites work: Santa claus meets hypergraph matchings
cites work: Q3549603
cites work: The Santa Claus problem
cites work: On Allocating Goods to Maximize Fairness
cites work: On (1,∊)-Restricted Assignment Makespan Minimization
cites work: Q3579476
cites work: Q4633864
cites work: New Constructive Aspects of the Lovász Local Lemma
cites work: A condition for matchability in hypergraphs
cites work: Approximation Algorithms for the Max-Min Allocation Problem
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
cites work: Santa Claus Schedules Jobs on Unrelated Machines
DOI: 10.1007/S00453-018-0407-8
description: scientific article; zbMATH DE number 6910201