Covering a set of points by two axis-parallel boxes
From MaRDI portal
Publication:294806
DOI10.1016/S0020-0190(00)00093-4zbMath1338.68255MaRDI QIDQ294806
Sergei Bespamyatnikh, Michael Segal
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000934?np=y
Related Items
A mixed integer formulation for maximal covering by inclined parallelograms ⋮ New algorithms for \(k\)-center and extensions ⋮ Square and Rectangle Covering with Outliers ⋮ Covering points by disjoint boxes with outliers ⋮ Covering points with convex sets of minimum size ⋮ Covering a set of points in a plane using two parallel rectangles ⋮ Covering Points with Convex Sets of Minimum Size ⋮ COVERING A POINT SET BY TWO DISJOINT RECTANGLES ⋮ New Algorithms for k-Center and Extensions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On piercing sets of axis-parallel rectangles and rings
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Finding tailored partitions
- Constrained square-center problems
- On some geometric selection and optimization problems via sorted matrices
