\(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes

DOI10.1007/S00454-002-0745-8zbMath1018.52010OpenAlexW2026302893MaRDI QIDQ1849443

Asa Packer

Publication date: 1 December 2002

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-002-0745-8

zbMATH Keywords

computational convexity\(d\)-simplextruncated simplex\(\mathbb{N}\mathbb{P}\)-hardness\(H\)-polytopes\(V\)-polytope

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

On statistical learning of simplices: unmixing problem revisited ⋮ Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope ⋮ A new convex model for linear hyperspectral unmixing ⋮ Polynomial-time approximation of largest simplices in \(V\)-polytopes. ⋮ Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization ⋮ Toward Quantifying Vertex Similarity in Networks ⋮ The integrality number of an integer program

This page was built for publication: \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes