| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656608 | Journal of Combinatorial Theory, Series A | 2006 | 10 Pages |
Abstract
The thinnest coverings of ellipsoids are studied in the Euclidean spaces of an arbitrary dimension n. Given any ellipsoid, our goal is to find the minimum number of unit balls needed to cover this ellipsoid. A tight asymptotic bound on the logarithm of this number is obtained.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
