Pages that link to "Item:Q1421471"

The following pages link to Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471):

Displaying 12 items.

• Complexity of approximating the vertex centroid of a polyhedron (Q764376) (← links)
• Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
• Oracle-polynomial-time approximation of largest simplices in convex bodies (Q1574577) (← links)
• Finding optimal shadows of polytopes (Q1580746) (← links)
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes (Q1849443) (← links)
• Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
• Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
• Volume maximization and orthoconvex approximation of orthogons (Q1969296) (← links)
• Polynomial-size vectors are enough for the unimodular triangulation of simplicial cones (Q2229183) (← links)
• Approximation of convex sets by polytopes (Q2519248) (← links)
• Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes (Q2804545) (← links)
• (Q6084421) (← links)