Pages that link to "Item:Q3557005"
From MaRDI portal
The following pages link to The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions (Q3557005):
Displayed 12 items.
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- The class cover problem with boxes (Q419500) (← links)
- On the number of maximum empty boxes amidst \(n\) points (Q1745207) (← links)
- Planar maximum-box problem revisited (Q1749536) (← links)
- On the largest empty axis-parallel box amidst \(n\) points (Q1950392) (← links)
- Deterministic constructions of high-dimensional sets with small dispersion (Q2149098) (← links)
- Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
- Maximum-weight planar boxes in \(O(n^2)\) time (and better) (Q2448119) (← links)
- Mini-Minimax Uncertainty Quantification for Emulators (Q2945172) (← links)
- Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
- Maximum box problem on stochastic points (Q5918465) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)