On the complexity of approximating the maximal inscribed ellipsoid for a polytope

On the complexity of approximating the maximal inscribed ellipsoid for a polytope

0.00 Avg rating0 Votes
Article ID: iaor19942305
Country: Netherlands
Volume: 61
Issue: 2
Start Page Number: 137
End Page Number: 159
Publication Date: Sep 1993
Journal: Mathematical Programming (Series A)
Authors: ,
Abstract:

The authors give a new polynomial bound on the complexity of approximating the maximal inscribed ellipsoid for a polytope.

Reviews

Required fields are marked *. Your email address will not be published.