Pages that link to "Item:Q1892425"

The following pages link to Largest \(j\)-simplices in \(n\)-polytopes (Q1892425):

Displaying 13 items.

• Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
• Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem (Q1923163) (← links)
• Exponential inapproximability of selecting a maximum volume sub-matrix (Q1939669) (← links)
• On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices (Q2310401) (← 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)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration (Q3387758) (← links)
• What is known about unit cubes (Q4663501) (← links)
• SISAL Revisited (Q5863525) (← links)
• On the parameterized intractability of determinant maximization (Q6547207) (← links)