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 language | English |
|---|---|
| Pages (from-to) | 163-213 |
| Number of pages | 51 |
| Journal | Mathematical Programming |
| Volume | 59 |
| Issue number | 2 |
| State | Published - 1 Jan 1993 |
| Externally published | Yes |
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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver