# The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs

We consider hypergraphs on vertices P∪ R where each hyperedge contains exactly one vertex in P. Our goal is to select a matching that covers all of P, but we allow each selected hyperedge to drop all but an (1/α)-fraction of its intersection with R (thus relaxing the matching constraint). Here α is to be minimized. We dub this problem the Combinatorial Santa Claus problem, since we show in this paper that this problem and the Santa Claus problem are almost equivalent in terms of their approximability. The non-trivial observation that any uniform regular hypergraph admits a relaxed matching for α = O(1) was a major step in obtaining a constant approximation rate for a special case of the Santa Claus problem, which received great attention in literature. It is natural to ask if the uniformity condition can be omitted. Our main result is that every (non-uniform) regular hypergraph admits a relaxed matching for α = O(loglog(|R|)), when all hyperedges are sufficiently large (a condition that is necessary). In particular, this implies an O(loglog(|R|))-approximation algorithm for the Combinatorial Santa Claus problem with large hyperedges.

• 10 publications
• 4 publications
• 23 publications
research
08/30/2018

### Improved approximation algorithms for hitting 3-vertex paths

We study the problem of deleting a minimum cost set of vertices from a g...
research
11/29/2020

### Approximation algorithms for hitting subgraphs

Let H be a fixed undirected graph on k vertices. The H-hitting set probl...
research
11/07/2020

### Combinatorial Bernoulli Factories: Matchings, Flows and Other Polytopes

A Bernoulli factory is an algorithmic procedure for exact sampling of ce...
research
05/04/2022

### A Perfect Sampler for Hypergraph Independent Sets

The problem of uniformly sampling hypergraph independent sets is revisit...
research
04/12/2022

### Linearly ordered colourings of hypergraphs

A linearly ordered (LO) k-colouring of an r-uniform hypergraph assigns a...
research
10/04/2021

### Hypergraph regularity and random sampling

Suppose a k-uniform hypergraph H that satisfies a certain regularity ins...
research
09/01/2020

### Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture

A well-known conjecture of Füredi, Kahn, and Seymour (1993) on non-unifo...