Pages that link to "Item:Q2809209"
From MaRDI portal
The following pages link to On some covering problems in geometry (Q2809209):
Displaying 15 items.
- Covering compact metric spaces greedily (Q722361) (← links)
- On the density of the thinnest covering of \(\mathbb{R}^n\) (Q785256) (← links)
- Covering the \(n\)-space by convex bodies and its chromatic number (Q941394) (← links)
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← links)
- Coverings: variations on a result of Rogers and on the epsilon-net theorem of Haussler and Welzl (Q1690259) (← links)
- Chromatic numbers of spheres (Q1783626) (← links)
- On a relation between packing and covering densities of convex bodies (Q2022613) (← links)
- Regular random sections of convex bodies and the random quotient-of-subspace theorem (Q2039846) (← links)
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! (Q2164729) (← links)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← links)
- Approximating set multi-covers (Q2408974) (← links)
- ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS (Q4435712) (← links)
- Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
- Spherical coverings and X-raying convex bodies of constant width (Q5888913) (← links)
- On a problem about covering lines by squares (Q5948105) (← links)
