The submodular Santa Claus problem in the restricted assignment case

DOI10.4230/LIPICS.ICALP.2021.22MaRDI QIDQ7241118zbMATH OpenFDO

Authors Étienne Bamas, Paritosh Garg, Lars Rohwedder

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.22

zbMATH Keywords

approximation algorithmhypergraph matchingschedulingsubmodularity

Mathematics Subject Classification ID

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

Cites work

• A constructive proof of the general Lovász local lemma
• A note on the integrality gap of the configuration LP for restricted Santa Claus
• A Tale of Santa Claus, Hypergraphs and Matroids
• Combinatorial algorithm for restricted max-min fair allocation
• Combinatorial auctions with decreasing marginal utilities
• scientific article; zbMATH DE number 5764883 (Why is no real title available?)
• scientific article; zbMATH DE number 7051222 (Why is no real title available?)
• On allocating goods to maximize fairness
• Optimal approximation for the submodular welfare problem in the value oracle model
• Quasi-polynomial local search for restricted max-min fair allocation
• Restricted max-min allocation: approximation and integrality gap
• Restricted Max-Min Fair Allocation
• Santa claus meets hypergraph matchings
• The Santa Claus problem

This page was built for publication: The submodular Santa Claus problem in the restricted assignment case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241118)