A Tale of Santa Claus, Hypergraphs and Matroids

DOI10.1137/1.9781611975994.167OpenAlexW3003074572MaRDI QIDQ5146963

Thomas Rothvoß, Sami Davies, Yi-Hao Zhang

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (7)

Restricted max-min allocation: integrality gap and approximation algorithm ⋮ Multistage online maxmin allocation of indivisible entities ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation ⋮ General max-min fair allocation ⋮ A Quasi-Polynomial Approximation for the Restricted Assignment Problem ⋮ Unnamed Item ⋮ Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings

This page was built for publication: A Tale of Santa Claus, Hypergraphs and Matroids