Polynomial-time approximation of largest simplices in V-polytopes
Author:
- 5 January 2004
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 134 (1-3) , 213-237
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- 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
- Largestj-simplices inn-polytopesDiscrete & Computational Geometry, 1995
- On the complexity of some basic problems in computational convexity: I. Containment problemsDiscrete Mathematics, 1994
- Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spacesMathematical Programming, 1993
- On principal angles between subspaces in RnLinear Algebra and its Applications, 1992
- 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