Better trees for Santa Claus
From MaRDI portal
Publication:6499346
DOI10.1145/3564246.3585174MaRDI QIDQ6499346
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the configuration-LP for scheduling on unrelated machines
- Approximation algorithms for scheduling unrelated parallel machines
- Estimating the makespan of the two-valued restricted assignment problem
- Polynomial time approximation algorithms for machine scheduling: Ten open problems
- A condition for matchability in hypergraphs
- Graph balancing: a special case of scheduling unrelated parallel machines
- The Santa Claus problem
- The Design of Approximation Algorithms
- Santa claus meets hypergraph matchings
- A constructive proof of the general lovász local lemma
- Polylogarithmic inapproximability
- Santa Claus Schedules Jobs on Unrelated Machines
- Approximation Algorithms for Directed Steiner Problems
- Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
- Combinatorial Algorithm for Restricted Max-Min Fair Allocation
- Restricted Max-Min Fair Allocation
- A Quasi-Polynomial Approximation for the Restricted Assignment Problem
- A Tale of Santa Claus, Hypergraphs and Matroids
- On Allocating Goods to Maximize Fairness
- MaxMin allocation via degree lower-bounded arborescences
- Lazy Local Search Meets Machine Scheduling
- On (1,∊)-Restricted Assignment Makespan Minimization
- Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Better trees for Santa Claus
