Few Cuts Meet Many Point Sets
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
