Rounding of polytopes in the real number model of computation

Let 𝒜 be a set of m points in ℝⁿ. We show that the problem of (1 + ε)n-rounding of 𝒜, i.e., the problem of computing an ellipsoid E ⊆ ℝⁿ such that [(1 + ε)n]⁻¹ E ⊆ conv. hull(𝒜) ⊆ E, can be solved in O(mn²(ε⁻¹ + ln n + ln ln m)) arithmetic operations and comparisons. This result implies that the problem of approximating the minimum volume ellipsoid circumscribed about 𝒜 can be solved in O(m^3.5 ln(mε⁻¹)) operations to a relative accuracy of ε in the volume. The latter bound also applies to the (1+ε)n-rounding problem. Our bounds hold for the real number model of computation.