Pages that link to "Item:Q3089094"
From MaRDI portal
The following pages link to COVERING A POINT SET BY TWO DISJOINT RECTANGLES (Q3089094):
Displayed 7 items.
- Covering points with convex sets of minimum size (Q1705773) (← 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)
- Covering Points with Convex Sets of Minimum Size (Q2803821) (← links)
- Optimizing Squares Covering a Set of Points (Q2942380) (← links)
- Covering uncertain points in a tree (Q5920112) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)