Better trees for Santa Claus
From MaRDI portal
Publication:6499346
DOI10.1145/3564246.3585174MaRDI QIDQ6499346FDOQ6499346
Authors: Étienne Bamas, Lars Rohwedder 
Publication date: 8 May 2024
Cites Work
- The design of approximation algorithms
- Graph balancing: a special case of scheduling unrelated parallel machines
- Polylogarithmic inapproximability
- Approximation Algorithms for Directed Steiner Problems
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Approximation algorithms for scheduling unrelated parallel machines
- A constructive proof of the general Lovász local lemma
- The Santa Claus problem
- Lazy local search meets machine scheduling
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- Title not available (Why is that?)
- On allocating goods to maximize fairness
- MaxMin allocation via degree lower-bounded arborescences
- A condition for matchability in hypergraphs
- Santa claus meets hypergraph matchings
- On the configuration-LP for scheduling on unrelated machines
- Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
- Restricted Max-Min Fair Allocation
- On \((1,\varepsilon)\)-restricted assignment makespan minimization
- Combinatorial algorithm for restricted max-min fair allocation
- Estimating the makespan of the two-valued restricted assignment problem
- Title not available (Why is that?)
- A Tale of Santa Claus, Hypergraphs and Matroids
- Quasi-polynomial local search for restricted max-min fair allocation
- Local search breaks 1.75 for graph balancing
- A quasi-polynomial approximation for the restricted assignment problem
This page was built for publication: Better trees for Santa Claus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499346)
