Few Cuts Meet Many Point Sets
Not on the map. Why?
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 9 Aug 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Covering a Few Submodular Constraints and Applicationscited by 0
- 2025Covering a Few Submodular Constraints and Applications14 Jul 2025