Covering an ellipsoid with equal balls

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.

• Type: Journal
• Year: 2006
• Where: JCT
• Authors: Ilya Dumer
• Keywords: Ellipsoid, JCT 2006, Thinnest Coverings, Tight Asymptotic Bound