Polynomial-time approximation of largest simplices in V-polytopes

This paper considers the problem of computing the squared volume of a largest j-dimensional simplex in an arbitrary d-dimensional polytope P given by its vertices (a "V-polytope"), for arbitrary integers j and d with 1 ≤ j ≤ d. The problem was shown by Gritzmann, Klee and Larman to be NP-hard. This paper examines the possible accuracy of deterministic polynomial-time approximation algorithms for the problem. On the negative side, it is shown that unless P = NP, no such algorithm can approximately solve the problem within a factor of less than 1.09. It is also shown that the NP-hardness and inapproximability continue to hold when the polytope P is restricted to be an affine crosspolytope.On the positive side, a simple deterministic polynomial-time approximation algorithm for the problem is described. The algorithm takes as input integers j and d with 1 ≤ j ≤ d and a V-polytope P of dimension d. It returns a j-simplex S ⊂ P such that vol2(T)/vol2(S) ≤ A(Bj)j, where T is any largest j-simplex in P, and A and B are positive constants independent of j, d, P.

[1]  Peter Gritzmann,et al.  Computational complexity of inner and outerj-radii of polytopes in finite-dimensional normed spaces , 1993, Math. Program..

[2]  Peter Gritzmann,et al.  Largestj-simplices inn-polytopes , 1995, Discret. Comput. Geom..

[3]  Peter Gritzmann,et al.  Oracle-polynomial-time approximation of largest simplices in convex bodies , 2000, Discret. Math..

[4]  Ernst W. Mayr,et al.  Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997) , 1998 .

[5]  Subhash Suri,et al.  Algorithms for minimum volume enclosing simplex in R3 , 2000, SODA '00.

[6]  A F Goetz,et al.  Imaging Spectrometry for Earth Remote Sensing , 1985, Science.

[7]  Yinyu Ye,et al.  Approximating quadratic programming with bound and quadratic constraints , 1999, Math. Program..

[8]  Alok Aggarwal,et al.  An Optimal Algorithm for Finding Minimal Enclosing Triangles , 1986, J. Algorithms.

[9]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[10]  P. M. Pardalos,et al.  Approximation and Complexity in Numerical Optimization: Continuous And Discrete Problems , 2006 .

[11]  Peter Gritzmann,et al.  Inapproximability of some Geometric and Quadratic Optimization Problems , 2000 .

[12]  Victor Klee,et al.  Finding the Smallest Triangles Containing a Given Convex Polygon , 1985, J. Algorithms.

[13]  Victor Klee,et al.  Largest j-simplices in d-cubes: Some relatives of the hadamard maximum determinant problem , 1996 .

[14]  Gangsong Leng,et al.  Largest parallelotopes contained in simplices , 2000, Discret. Math..

[15]  Peter Gritzmann,et al.  On the complexity of some basic problems in computational convexity: I. Containment problems , 1994, Discret. Math..

[16]  Marek Lassak,et al.  Parallelotopes of Maximum Volume in a Simplex , 1999, Discret. Comput. Geom..

[17]  David M. Mount,et al.  A parallel algorithm for enclosed and enclosing triangles , 1992, Int. J. Comput. Geom. Appl..

[18]  R. Renner.  The resolution of a compositional data set into mixtures of fixed source compositions , 1993 .

[19]  Thomas Jansen,et al.  Introduction to the Theory of Complexity and Approximation Algorithms , 1997, Lectures on Proof Verification and Approximation Algorithms.

[20]  Johann Bodechtel,et al.  Imaging spectroscopy: fundamentals and prospective applications. , 1992 .

[21]  Peter Gritzmann,et al.  On the Complexity of some Basic Problems in Computational Convexity: II. Volume and mixed volumes , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Adi Ben-Israel,et al.  On principal angles between subspaces in Rn , 1992 .

[24]  Asa Packer.  NP -Hardness of Largest Contained and Smallest Containing Simplices for V- and H-Polytopes , 2002, Discret. Comput. Geom..

[25]  Gert Vegter,et al.  Minimal circumscribing simplices , 1991 .