Covering points by disjoint boxes with outliers

Covering points by disjoint boxes with outliers

For a set of n points in the plane, we consider the axis-aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n−k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the larges...

Full description

Bibliographic Details
Main Authors: Ahn, Hee-Kap, Bae, Sang Won, Demaine, Erik D., Demaine, Martin L., Kim, Sang-Sub, Korman, Matias, Reinbacher, Iris, Son, Wanbin
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Elsevier 2015
Online Access:http://hdl.handle.net/1721.1/98861
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/98861
https://orcid.org/0000-0003-3803-5703

Similar Items