Few Cuts Meet Many Point Sets
share
We study the problem of how to breakup many point sets in 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.
READ FULL TEXT