Exact algorithms for optimal discretization
An algorithm for optimal discretization that runs in time $2^n$ and the related point separation problem that asks to separate all input points by axis-parallel lines is studied, with guarantees that hold even if points are allowed to share coordinates.