Pages that link to "Item:Q1421471"
From MaRDI portal
The following pages link to Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471):
Displayed 5 items.
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
- Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← 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)