scientific article; zbMATH DE number 7561531

DOI10.4230/LIPICS.ICALP.2019.38MaRDI QIDQ5091188

Yuchen Mao, Siu-Wing Cheng

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1905.06084

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationintegrality gapfair allocationconfiguration LP

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (5)

Restricted max-min allocation: integrality gap and approximation algorithm ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation ⋮ General max-min fair allocation ⋮ A Quasi-Polynomial Approximation for the Restricted Assignment Problem ⋮ Better trees for Santa Claus

Cites Work

• Unnamed Item
• Unnamed Item
• A condition for matchability in hypergraphs
• A note on the integrality gap of the configuration LP for restricted Santa Claus
• Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation
• The Santa Claus problem
• Santa claus meets hypergraph matchings
• 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
• MaxMin allocation via degree lower-bounded arborescences
• New Constructive Aspects of the Lovász Local Lemma
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: