The following pages link to The class cover problem with boxes (Q419500):
Displaying 13 items.
- Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions (Q335346) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- Covering points by disjoint boxes with outliers (Q617548) (← links)
- Classification using proximity catch digraphs (Q782440) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- The maximum exposure problem (Q2123293) (← links)
- On the geometric red-blue set cover problem (Q2232240) (← links)
- Classifying negative and positive points by optimal box clustering (Q2448911) (← links)
- On covering \(\mathbb Z\)-grid points by rectangles (Q2816037) (← links)
- Computing coverage kernels under restricted settings (Q5919535) (← links)
- The board packing problem (Q6167668) (← links)
- Generalized class cover problem with axis-parallel strips (Q6543343) (← links)
- Online class cover problem (Q6600810) (← links)
