Pages that link to "Item:Q1892425"

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

Displaying 20 items.

• Maximum volume polytopes inscribed in the unit sphere (Q328588) (← links)
• Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope (Q845815) (← links)
• Parallelotopes of maximum volume in a simplex (Q1289247) (← links)
• On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
• Maximal \(j\)-simplices in the real \(d\)-dimensional unit cube (Q1369731) (← links)
• Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471) (← links)
• \(n\)-cubes inscribed in simplices (Q1775250) (← links)
• \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes (Q1849443) (← 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)
• Largest parallelotopes contained in simplices (Q1969781) (← 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)
• On largest volume simplices and sub-determinants (Q5362979) (← links)
• SISAL Revisited (Q5863525) (← links)
• On the parameterized intractability of determinant maximization (Q6547207) (← links)