On the Inapproximability of Polynomial-programming, the Geometry of Stable Sets, and the Power of Relaxation-Reference-Cited by-同舟云学术

On the Inapproximability of Polynomial-programming, the Geometry of Stable Sets, and the Power of Relaxation

Published:2003 Issue: Volume: Page:301-311
ISSN:0937-5511
Container-title:Algorithms and Combinatorics
language:
Short-container-title:

Author:

Brieden Andreas,Gritzmann Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-55566-4_13.pdf

Reference15 articles.

1. M. Bellare and P. Rogaway, The complexity of appro6ximating a nonlinear program, Math. Prog. 69 (1995), 429-441.

2. A. Brieden, On geometric optimization problems likely not contained in APX, Discrete Comp. Geom. 28 (2002), 201-209.

3. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lov¡äasz, and M. Simonovits, Deterministic and randomized polynomial-time approximation of radii, Mathematika, 2003, in print.

4. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lov¡äasz, and M. Simonovits, Approximation of radii and norm-maxima: Randomization doesn’t help, Proc. 39th IEEE FOCS, 1998, pp. 244-251.

5. 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.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Institutions and Entrepreneurial Activity: A Quantitative Empirical Analysis;Societies and Political Orders in Transition;2020-10-02