NOTE ON THE COMPUTATIONAL-COMPLEXITY OF J-RADII OF POLYTOPES IN R(N)

Authors
FAIGLE U KERN W STRENG M
Citation
U. Faigle et al., NOTE ON THE COMPUTATIONAL-COMPLEXITY OF J-RADII OF POLYTOPES IN R(N), Mathematical programming, 73(1), 1996, pp. 1-5
Citations number
8
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science",Mathematics,"Computer Science Software Graphycs Programming
Journal title
Mathematical programming → ACNP
ISSN journal
00255610
Volume
73
Issue
1
Year of publication
1996
Pages
1 - 5
Database
ISI
SICI code
0025-5610(1996)73:1<1:NOTCOJ>2.0.ZU;2-Z
Abstract
We show that, for fixed dimension n, the approximation of inner and ou ter j-radii of polytopes in R(n), endowed with the Euclidean norm, is in P. Our method is based on the standard polynomial time algorithms f or solving a system of polynomial inequalities over the reals in fixed dimension.