Few Cuts Meet Many Point Sets

We study the problem of how to split many point sets in ℝ^d into smaller parts using a few (shared) splitting hyperplanes. This problem is related to the classical Ham-Sandwich Theorem. We provide a logarithmic approximation to the optimal solution using the greedy algorithm for submodular optimization.