NP -Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes
Author:
Open Access
- 1 August 2002
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 28 (3) , 349-377
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Polynomial-time approximation of largest simplices in V-polytopesDiscrete Applied Mathematics, 2004
- Oracle-polynomial-time approximation of largest simplices in convex bodiesDiscrete Mathematics, 2000
- Largest parallelotopes contained in simplicesDiscrete Mathematics, 2000
- Parallelotopes of Maximum Volume in a SimplexDiscrete & Computational Geometry, 1999
- Largest j-simplices in d-cubes: Some relatives of the hadamard maximum determinant problemLinear Algebra and its Applications, 1996
- The Resolution of a Compositional Data Set into Mixtures of Fixed Source CompositionsJournal of the Royal Statistical Society Series C: Applied Statistics, 1993
- A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLESInternational Journal of Computational Geometry & Applications, 1992
- Finding the smallest triangles containing a given convex polygonJournal of Algorithms, 1985