Covering points by disjoint boxes with outliers
type: Item
instance of: scholarly article
title: Covering points by disjoint boxes with outliers
zbMATH Open document ID: 1217.68109
author: Hee-Kap Ahn
author: Sang Won Bae
author: Erik D. Demaine
author: Martin L. Demaine
author: Sang-Sub Kim
author: Matias Korman
author: Iris Reinbacher
author: Wanbin Son
published in: Computational Geometry
publication date: 2011-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 52C22
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5840150
zbMATH Keywords: NP-hard
zbMATH Keywords: optimization
zbMATH Keywords: outliers
zbMATH Keywords: rectangle covering
zbMATH Keywords: square covering
zbMATH Keywords: rectilinear \(p\)-center problem
MaRDI profile type: Publication
full work available at URL: j.comgeo.2010.10.002
OpenAlex ID: W2128262571
cites work: Finding k points with minimum diameter and related problems
cites work: Covering a Point Set by Two Disjoint Rectangles
cites work: Algorithms for optimal outlier removal
cites work: Covering a set of points by two axis-parallel boxes
cites work: Geometric applications of a randomized optimization technique
cites work: Low-Dimensional Linear Programming with Violations
cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
cites work: Introduction to algorithms
cites work: Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
cites work: Optimal packing and covering in the plane are NP-complete
cites work: Discrete rectilinear 2-center problems
cites work: Planar Formulae and Their Uses
cites work: On geometric optimization with few violated constraints
cites work: On the Complexity of Some Common Geometric Location Problems
cites work: Covering a set of points in a plane using two parallel rectangles
cites work: Lower bounds for covering problems
cites work: Enclosing \(k\) points in the smallest axis parallel rectangle
cites work: A combinatorial bound for linear programming and related problems
DOI: 10.1016/J.COMGEO.2010.10.002
description: scientific article; zbMATH DE number 5840150