Better Trees for Santa Claus
Abstract
References
Index Terms
- Better Trees for Santa Claus
Recommendations
The Santa Claus problem
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingWe consider the following problem: The Santa Claus has n presents that he wants to distribute among m kids. Each kid has an arbitrary value for each present. Let pij be the value that kid i has for present j. The Santa's goal is to distribute presents ...
Santa claus meets hypergraph matchings
We consider the restricted assignment version of the problem of max-min fair allocation of indivisible goods, also known as the Santa Claus problem. There are m items and n players. Every item has some nonnegative value, and every player is interested ...
Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma
The Lopsided Lovász Local Lemma (LLLL) is a powerful probabilistic principle that has been used in a variety of combinatorial constructions. While this principle began as a general statement about probability spaces, it has recently been transformed ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- NWO
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigact
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 185Total Downloads
- Downloads (Last 12 months)71
- Downloads (Last 6 weeks)6
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in