Polynomial-time approximation of largest simplices in \(V\)-polytopes. (Q1421471): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle-polynomial-time approximation of largest simplices in convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some basic problems in computational convexity. I. Containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest \(j\)-simplices in \(n\)-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the theory of complexity and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the smallest triangles containing a given convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelotopes of maximum volume in a simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest parallelotopes contained in simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On principal angles between subspaces in \(\mathbb{R}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for finding minimal enclosing triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathbb N\mathbb P\)-hardness of largest contained and smallest containing simplices for \(V\)- and \(H\)-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Resolution of a Compositional Data Set into Mixtures of Fixed Source Compositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952659 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:18, 6 June 2024

scientific article
Language Label Description Also known as
English
Polynomial-time approximation of largest simplices in \(V\)-polytopes.
scientific article

    Statements

    Polynomial-time approximation of largest simplices in \(V\)-polytopes. (English)
    0 references
    0 references
    26 January 2004
    0 references
    Containment problems
    0 references
    Simplex
    0 references
    Crosspolytope
    0 references
    Determinant
    0 references
    Inapproximability
    0 references
    Polynomial-time
    0 references
    Approximation algorithm
    0 references
    Computational complexity
    0 references
    \(\mathbb{NP}\)-hardness
    0 references

    Identifiers