The following pages link to Planar maximum box problem (Q1876598):
Displaying 8 items.
- The maximum box problem for moving points in the plane (Q411213) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- Planar maximum-box problem revisited (Q1749536) (← links)
- The maximum box problem and its application to data analysis (Q1856362) (← links)
- A combinatorial branch-and-bound algorithm for box search (Q2339825) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- Classifying negative and positive points by optimal box clustering (Q2448911) (← links)
- Maximum volume subset selection for anchored boxes (Q4580096) (← links)
