Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of \mathbb{R}^d are equivalent, we introduce the following natural partition problem which we call the secluded hypercube partition problem: Given k\in\mathbb{N} (ideally small) and \epsilon>0 (ideally large), is there a partition of ... more >>>