Geometric optimization problems likely not contained in double-struck A signℙdouble-struck X sign

Discrete and Computational Geometry

Volumn 28, Issue 2, 2002, Pages 201-209

  Brieden, Andreas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036768739     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-2756-x     Document Type: Article

References (11)

1. [BGK] A. Brieden, P. Gritzmann, and V. Klee, Inapproximability of some geometric and quadratic optimization problems, In: Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (P. M. Pardalos, ed.), Nonconvex Optimization and its Applications, vol. 42, Kluwer, Boston, 2000, pp. 96-115.
2. +1] A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, and M. Simonovits, Approximation of radii and norm-maxima: randomization doesn't help, Proc. 39th IEEE FOCS, 1998, pp. 244-251.
3. +2] A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász, and M. Simonovits, Deterministic and randomized polynomial-time approximation of radii, to appear in Mathematika.
4. [BGKL] H.L. Bodlaender, P. Gritzmann, V. Klee, and J. van Leeuwen, Computational complexity of norm-maximization, Combinatorica 10(2) (1990), 203-225.
5. [BR] M. Bellare and P. Rogaway, The complexity of approximating a nonlinear program, Math. Programming 69 (1995), 429-441.
6. [FK] U. Feige and J. Kilian, Two prover protocols-low error at affordable rates, Proc. 26th ACM STOC, 1994, pp. 172-183.
7. [FL] U. Feige and L. Lovász, Two-prover one-round proof systems: their power and their problems, Proc. 24th ACM STOC, 1992, pp. 733-744.
8. [GK1] P. Gritzmann and V. Klee, Inner and outer j-radii of convex bodies in finite-dimensional normed spaces, Discrete Comput. Geom. 7 (1992), 255-280.
9. [GK2] P. Gritzmann and V. Klee, Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces, Math. Programming 59 (1993), 163-213.
10. [GK3] P. Gritzmann and V. Klee, Computational convexity, In: Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, eds.), CRC Press, Boca Raton, FL, 1997, pp. 491-516.
11. Y. Ye, Approximating quadratic programming with bound constraints, Working paper, Department of Management Science, University of Iowa, Iowa City, IA 52242, 1997.