Publication | Closed Access
Deterministic and randomized polynomial‐time approximation of radii
50
Citations
30
References
2001
Year
Mathematical ProgrammingNumerical AnalysisComputational Complexity TheoryEngineeringComputational ComplexityConvex HullPolynomial‐time ApproximationComputational GeometryApproximation TheoryGeometric ModelingApproximation AlgorithmsGeometric AlgorithmNatural SciencesConvex OptimizationOptimization OracleApproximation MethodN-dimensional LpWeak SeparationRandomized Algorithm
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1