Pages that link to "Item:Q294806"
From MaRDI portal
The following pages link to Covering a set of points by two axis-parallel boxes (Q294806):
Displaying 14 items.
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Covering boxes by points (Q687139) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- Covering a set of points in a plane using two parallel rectangles (Q989524) (← links)
- Covering a set of points in multidimensional space (Q1183467) (← links)
- Covering points with convex sets of minimum size (Q1705773) (← links)
- A mixed integer formulation for maximal covering by inclined parallelograms (Q1876161) (← links)
- Planar maximum box problem (Q1876598) (← links)
- The area of empty axis-parallel boxes amidst 2-dimensional lattice points (Q2693685) (← links)
- Placing two axis-parallel squares to maximize the number of enclosed points (Q2792797) (← links)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
- Square and Rectangle Covering with Outliers (Q5321703) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)