Skip to main navigation Skip to search Skip to main content

Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces

  • University of Trier

Research output: Contribution to journal › Article › peer-review

34 Scopus citations

Abstract

This paper studies the complexity of computing (or approximating, or bounding) the various inner and outer radii of an n-dimensional convex polytope in the space equipped with an lp norm or a polytopal norm.

Original languageEnglish
Pages (from-to)163-213
Number of pages51
JournalMathematical Programming
Volume59
Issue number2
StatePublished - 1 Jan 1993
Externally publishedYes

Fingerprint

Dive into the research topics of 'Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces'. Together they form a unique fingerprint.

Cite this