The following pages link to Covering with Euclidean boxes (Q1091402):
Displaying 18 items.
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- Domination in transitive colorings of tournaments (Q403357) (← links)
- Positive-fraction intersection results and variations of weak epsilon-nets (Q527009) (← links)
- Gallai-type results for multiple boxes and forests (Q583206) (← links)
- Covering boxes by points (Q687139) (← links)
- Extended box clustering for classification problems (Q724605) (← links)
- Tverberg's theorem, disks, and Hamiltonian cycles (Q825963) (← links)
- Independent collections of translates of boxes and a conjecture due to Grünbaum (Q1196369) (← links)
- On a Ramsey-theoretic property of orders (Q1199999) (← links)
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl (Q1690259) (← links)
- Containment problems in high-dimensional spaces (Q1906857) (← links)
- Covering the 3-dimensional unit cube by six rectangular boxes (Q2256991) (← links)
- On 2min-sets and 2minmax-sets with respect to certain cycles (Q2259383) (← links)
- A proof of the Erdös-Sands-Sauer-Woodrow conjecture (Q2312612) (← links)
- Approximating set multi-covers (Q2408974) (← links)
- Supervised box clustering (Q2418297) (← links)
- A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\) (Q2490871) (← links)
- Intersecting diametral balls induced by a geometric graph (Q6151026) (← links)
