Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces
- 1 March 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 59 (1-3), 163-213
- https://doi.org/10.1007/bf01581243
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Good and Bad Radii of Convex PolygonsSIAM Journal on Computing, 1991
- On the complexity of some geometric problems in unbounded dimensionJournal of Symbolic Computation, 1990
- Finding the convex hull facet by facetJournal of Algorithms, 1985
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- Polygonal approximation by the minimax methodComputer Graphics and Image Processing, 1982
- Polynomial algorithms in linear programmingUSSR Computational Mathematics and Mathematical Physics, 1980
- The maximum numbers of faces of a convex polytopeMathematika, 1970
- The Smallest Covering Cone or Sphere (C. Groenewod and L. Eusanio)SIAM Review, 1965
- DIAMETERS OF SETS IN FUNCTION SPACES AND THE THEORY OF BEST APPROXIMATIONSRussian Mathematical Surveys, 1960
- Über konvexe GebildeMonatshefte für Mathematik, 1920