**Covering many points with a small-area box**.

M. De Berg, S. Cabello, O. Cheong, D. Eppstein, and C. Knauer.

arXiv:1612.02149.

We give an efficient algorithm for finding the smallest axis-parallel rectangle covering a given number of points out of a larger set of points in the plane.

Co-authors – Publications – David Eppstein – Theory Group – Inf. & Comp. Sci. – UC Irvine

Semi-automatically filtered from a common source file.