Largest j-simplices in n-polytopes
From MaRDI portal
Recommendations
- Polynomial-time approximation of largest simplices in \(V\)-polytopes.
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope
- N P-hardness of largest contained and smallest containing simplices for V- and H-polytopes
- Maximal \(j\)-simplices in the real \(d\)-dimensional unit cube
- On largest volume simplices and sub-determinants
Cites work
- scientific article; zbMATH DE number 3872174 (Why is no real title available?)
- scientific article; zbMATH DE number 18983 (Why is no real title available?)
- scientific article; zbMATH DE number 3576997 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 665697 (Why is no real title available?)
- scientific article; zbMATH DE number 1142309 (Why is no real title available?)
- scientific article; zbMATH DE number 3217531 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3065542 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
- A new polynomial-time algorithm for linear programming
- A random polynomial time algorithm for well-routing convex bodies
- An optimal algorithm for finding minimal enclosing triangles
- Applications of random sampling in computational geometry. II
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Computational complexity of norm-maximization
- Deciding uniqueness in norm maximazation
- Diameter, width, closest line pair, and parametric searching
- Die meisten konvexen Körper sind glatt, aber nicht zu glatt
- Finding the smallest triangles containing a given convex polygon
- Geometric algorithms and combinatorial optimization
- Hard Enumeration Problems in Geometry and Combinatorics
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- On The Complexity of Computing Mixed Volumes
- On maximal simplices inscribed in a central convex set
- On recognizing integer polyhedra
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Polynomial algorithms in linear programming
- Reducibility among combinatorial problems
- Some new results on smoothness and rotundity in normed linear spaces
- The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
- The complexity of satisfiability problems
- The content of some extreme simplexes
- The maximum numbers of faces of a convex polytope
Cited in
(22)- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- N P-hardness of largest contained and smallest containing simplices for V- and H-polytopes
- scientific article; zbMATH DE number 1885207 (Why is no real title available?)
- Randomized rounding for the largest simplex problem
- What is known about unit cubes
- \(n\)-cubes inscribed in simplices
- Polynomial-time approximation of largest simplices in \(V\)-polytopes.
- Maximum volume polytopes inscribed in the unit sphere
- Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
- SISAL revisited
- Approximation of convex sets by polytopes
- scientific article; zbMATH DE number 2169110 (Why is no real title available?)
- Subdeterminant maximization via nonconvex relaxations and anti-concentration
- On largest volume simplices and sub-determinants
- Computing maximal copies of polyhedra contained in a polyhedron
- Largest parallelotopes contained in simplices
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- On the complexity of some basic problems in computational convexity. I. Containment problems
- On the parameterized intractability of determinant maximization
- Exponential inapproximability of selecting a maximum volume sub-matrix
This page was built for publication: Largest \(j\)-simplices in \(n\)-polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892425)
