Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
From MaRDI portal
Publication:1864187
DOI10.1007/s00454-002-2756-xzbMath1028.90082OpenAlexW2069172499MaRDI QIDQ1864187
Publication date: 17 March 2003
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-002-2756-x
Related Items (7)
Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope ⋮ SHARPENING GEOMETRIC INEQUALITIES USING COMPUTABLE SYMMETRY MEASURES ⋮ Nearly optimal minimax estimator for high-dimensional sparse linear regression ⋮ Constrained clustering via diagrams: a unified theory and its application to electoral district design ⋮ Efficient subspace approximation algorithms ⋮ Complexity results for some global optimization problems ⋮ Fixed-parameter complexity and approximability of norm maximization
This page was built for publication: Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)