Santa claus meets hypergraph matchings
From MaRDI portal
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
- Santa Claus Meets Hypergraph Matchings
- A Tale of Santa Claus, Hypergraphs and Matroids
- On matchings in hypergraphs
- On a hypergraph matching problem
- The clique complex and hypergraph matching
- Matchings in hypergraphs of large minimum degree
- scientific article; zbMATH DE number 5763200
- Matchings and covers in hypergraphs
- Matching of given sizes in hypergraphs
- Pseudorandom hypergraph matchings
Cited in
(30)- Matching orderable and separable hypergraphs
- Restricted max-min allocation: integrality gap and approximation algorithm
- A note on the integrality gap of the configuration LP for restricted Santa Claus
- General max-min fair allocation
- PTAS for ordered instances of resource allocation problems
- Santa Claus Meets Hypergraph Matchings
- Approximating the Nash Social Welfare with Indivisible Items
- On the configuration-LP for scheduling on unrelated machines
- Finding independent transversals efficiently
- Restricted Max-Min Fair Allocation
- Restricted max-min allocation: approximation and integrality gap
- Local search breaks 1.75 for graph balancing
- A quasi-polynomial approximation for the restricted assignment problem
- Lazy local search meets machine scheduling
- Compact LP relaxations for allocation problems
- Perfect matching in bipartite hypergraphs subject to a demand graph
- Polynomial-time combinatorial algorithm for general max-min fair allocation
- Better trees for Santa Claus
- Maximin fair allocation of indivisible items under cost utilities
- Constructing graphs with no independent transversals
- A geometric programming approach to solve the restricted assignment case of the Santa Claus problem
- Randomized strategyproof mechanisms with best of both worlds fairness and efficiency
- Fast algorithms for maximizing the minimum eigenvalue in fixed dimension
- Improved integrality gap in max-min allocation, or, topology at the north pole
- The submodular Santa Claus problem in the restricted assignment case
- Additive approximation schemes for load balancing problems
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- Almost envy-free allocation of indivisible goods: a tale of two valuations
- Parameterized hardness results for the \textsc{Restricted Santa Claus Problem}
- Strong LP formulations for scheduling splittable jobs on unrelated machines
This page was built for publication: Santa claus meets hypergraph matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189065)
