# Few Cuts Meet Many Point Sets

arXiv: https://arxiv.org/abs/1808.03260 · HTML: https://mlsanity.com/paper/1808.03260/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 9 Aug 2018.

## Built on by (most cited first, 1 of 1)

- [Covering a Few Submodular Constraints and Applications](https://mlsanity.com/paper/2507.09879/) (2025)

## Abstract (arXiv)

We study the problem of how to breakup many point sets in ℝ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.