scientific article; zbMATH DE number 1560333

MaRDI QIDQ4527183zbMATH OpenFDO

Authors Andreas Brieden, Peter Gritzmann, Victor Klee

Publication date 1 February 2001

zbMATH Keywords

algorithmapproximationAPX-completenessAPX-hardnesscircumradiusdiameterinradiusnorm maximizationparallelotopeperformance ratiopolynomial timepseudo-Boolean programmingquadratic programmingsimplexwidth

Mathematics Subject Classification ID

Boolean programming (90C09) Quadratic programming (90C20) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
• Some easy and some not so easy geometric optimization problems
• Deterministic and randomized polynomial‐time approximation of radii
• Computational complexity of norm-maximization
• Polynomial-time approximation of largest simplices in \(V\)-polytopes.

Cited in

(10)

• Complexity results for some global optimization problems
• Polynomial-time approximation of largest simplices in \(V\)-polytopes.
• Some easy and some not so easy geometric optimization problems
• Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
• Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)
• Fixed-parameter complexity and approximability of norm maximization
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Deterministic and randomized polynomial‐time approximation of radii
• scientific article; zbMATH DE number 2209720 (Why is no real title available?)
• scientific article; zbMATH DE number 7053310 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527183)