Inapproximability of some Geometric and Quadratic Optimization Problems
- 1 January 2000
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Approximability of maximum splitting of k-sets and some other Apx-complete problemsInformation Processing Letters, 1996
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Inhomogeneous annular plates with exactly beam-like radial spectraIMA Journal of Applied Mathematics, 1993
- Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spacesMathematical Programming, 1993
- Inner and outerj-radii of convex bodies in finite-dimensional normed spacesDiscrete & Computational Geometry, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Good and Bad Radii of Convex PolygonsSIAM Journal on Computing, 1991
- On the 0–1-Maximization of Positive Definite Quadratic FormsOperations Research Proceedings, 1989
- Experimental designs through level reduction of the d-dimensional cuboctahedronDiscrete Mathematics, 1972
- Volumen und Oberfl cheMathematische Annalen, 1903