Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces
From MaRDI portal
Publication:2368077
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- Computational complexity of norm-maximization
- Computing the width of a set
- DIAMETERS OF SETS IN FUNCTION SPACES AND THE THEORY OF BEST APPROXIMATIONS
- Finding the convex hull facet by facet
- Geometric algorithms and combinatorial optimization
- Good and Bad Radii of Convex Polygons
- scientific article; zbMATH DE number 3858224 (Why is no real title available?)
- scientific article; zbMATH DE number 3876377 (Why is no real title available?)
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 4200003 (Why is no real title available?)
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 3980484 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 3677572 (Why is no real title available?)
- scientific article; zbMATH DE number 37080 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3594676 (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 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- On the complexity of four polyhedral set containment problems
- On the complexity of some geometric problems in unbounded dimension
- Optimal scaling of balls and polyhedra
- Polygonal approximation by the minimax method
- Polynomial algorithms in linear programming
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
- The Complexity of Vertex Enumeration Methods
- The maximum numbers of faces of a convex polytope
- The Minimum Covering Sphere Problem
- The Width of a Chair
Cited in
(34)- The analysis and the representation of balanced complex polytopes in 2D
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Polynomial-time approximation of largest simplices in \(V\)-polytopes.
- Inner and outer approximations of polytopes using boxes.
- Successive radii and ball operators in generalized Minkowski spaces
- On computing the diameter of a point set in high dimensional Euclidean space.
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- Largest \(j\)-simplices in \(n\)-polytopes
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)
- Largest j-simplices in d-cubes: Some relatives of the Hadamard maximum determinant problem
- No dimension-independent core-sets for containment under homothetics
- Computing the discrete compactness of orthogonal pseudo-polytopes via their nD-EVM representation
- Complexity yardsticks for \(f\)-vectors of polytopes and spheres
- Calculus of fuzzy vector-valued functions and almost periodic fuzzy vector-valued functions on time scales
- Fixed-parameter complexity and approximability of norm maximization
- A note on approximation of a ball by polytopes
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
- Sharpening geometric inequalities using computable symmetry measures
- Good and Bad Radii of Convex Polygons
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- A Variable-Complexity Norm Maximization Problem
- Successive radii and Minkowski addition
- Deterministic and randomized polynomial‐time approximation of radii
- A semidefinite hierarchy for containment of spectrahedra
- Minimal containment under homothetics: a simple cutting plane approach
- Radii minimal projections of polytopes and constrained optimization of symmetric polynomials
- On clustering bodies: geometry and polyhedral approximation
- Diversities and the generalized circumradius
- Efficient subspace approximation algorithms
- Deciding uniqueness in norm maximazation
- Computational complexity of norm-maximization
- Parameterized complexity and improved inapproximability for computing the largest \(j\)-simplex in a \(V\)-polytope
- Fitting enclosing cylinders to data in \(\mathbb R^n\)
- Intrinsic volumes and successive radii
This page was built for publication: Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368077)
