This paper is concerned with convex bodies in n-dimensional lp, spaces, where each body is accessible only by a weak separation or optimization oracle. It studies the asymptotic relative accuracy, as n→∞, of polynomial-time approximation algorithms for the diameter, width, circumradius, and inradius of a body K, and also for the maximum of the norm over K.
No takes yet. Share an insight, caveat, or question.
Brieden et al. (2001) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: