The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Santa Claus problem
Abstract
We 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 in such a way that the least lucky kid is as happy as possible, i.e he tries to maximize mini=1,...,m sumj ∈ Si pij where Si is a set of presents received by the i-th kid.Our main result is an O(log log m/log log log m) approximation algorithm for the restricted assignment case of the problem when pij ∈ pj,0 (i.e. when present j has either value pj or 0 for each kid). Our algorithm is based on rounding a certain natural exponentially large linear programming relaxation usually referred to as the configuration LP. We also show that the configuration LP has an integrality gap of Ω(m1/2) in the general case, when pij can be arbitrary.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Alon, N., & Spencer, J. H. (2000) · Wiley eBooks · doi:10.1002/0471722154 · Cited by 949
An approximation algorithm for the generalized assignment problem
Shmoys, D. B., & Tardos, É. (1993) · Mathematical Programming · doi:10.1007/bf01585178 · Cited by 726
On approximately fair allocations of indivisible goods
Lipton, R. J., Markakis, E., Mossel, E., & Saberi, A. (2004) · Proceedings of the 5th ACM conference on Electronic commerce · doi:10.1145/988772.988792 · Cited by 514
An efficient approximation scheme for the one-dimensional bin-packing problem
Karmarkar, N. K., & Karp, R. M. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.61 · Cited by 491
Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
Deuermeyer, B. L., Friesen, D. K., & Langston, M. A. (1982) · SIAM Journal on Algebraic and Discrete Methods · doi:10.1137/0603019 · Cited by 119
Max-min fair allocation of indivisible goods
Golovin, D. (2018) · doi:10.1184/r1/6607142 · Cited by 60
Cited by
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., & Zemel, R. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090255 · Cited by 3,501
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., & Zemel, R. (2011) · arXiv · doi:10.48550/arxiv.1104.3913 · Cited by 55
Metadata
- Authors
- Bansal, N., & Sviridenko, M.
- Venue
- Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
- Publisher
- ACM
- Published
- 2006-05-21
- Pages
- 31-40
- OpenAlex
- W1978593916
- Cited by
- 256
- References
- 7
- FWCI
- 5.19
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Santa Claus problem. https://app.cochat.ai/papers/10.1145/1132516.1132522
- The paper
- Bansal, N., & Sviridenko, M. (2006). The Santa Claus problem. Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing. https://doi.org/10.1145/1132516.1132522
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.