Few Cuts Meet Many Point Sets

Abstract

We study the problem of how to breakup many point sets in ${\mathbb{R}}^d$ into smaller parts using a few splitting (shared) 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.