Oracle-polynomial-time approximation of largest simplices in convex bodies

DOI10.1016/S0012-365X(99)00387-8zbMath0959.90046MaRDI QIDQ1574577

Andreas Brieden, Victor Klee, Peter Gritzmann

Publication date: 2 May 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

approximationdeterminantsimplexpolynomial timeoraclealgorithmic theory of convex bodies

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Nonlinear programming (90C30) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Determinants, permanents, traces, other special matrix functions (15A15)

Related Items (2)

Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope ⋮ Polynomial-time approximation of largest simplices in \(V\)-polytopes.

This page was built for publication: Oracle-polynomial-time approximation of largest simplices in convex bodies