Pages that link to "Item:Q1975961"
From MaRDI portal
The following pages link to Discrete rectilinear 2-center problems (Q1975961):
Displayed 11 items.
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
- Covering a set of points in a plane using two parallel rectangles (Q989524) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- Efficient algorithms for computing one or two discrete centers hitting a set of line segments (Q2424732) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094) (← links)
- Square and Rectangle Covering with Outliers (Q5321703) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)