Pages that link to "Item:Q2809209"

The following pages link to On some covering problems in geometry (Q2809209):

Displaying 11 items.

• Covering compact metric spaces greedily (Q722361) (← links)
• On the density of the thinnest covering of \(\mathbb{R}^n\) (Q785256) (← 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)
• 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)
• Approximate CVP_p in Time 2^{0.802 n} (Q5874513) (← links)
• Spherical coverings and X-raying convex bodies of constant width (Q5888913) (← links)