Polynomial-time approximation of largest simplices in V-polytopes

Discrete Applied Mathematics

Volumn 134, Issue 1-3, 2004, Pages 213-237

  Packer, Asa ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

hardness; Approximation algorithm; Computational complexity; Containment problems; Crosspolytope; Determinant; Inapproximability; Polynomial time; Simplex

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

POLYTOPES;

POLYNOMIAL APPROXIMATION;

EID: 0242570402     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00226-9     Document Type: Article

References (25)

1. J.W. Boardman, A.F.H. Goetz, Sedimentary facies analysis using imaging spectrometry: a geophysical inverse problem, Proceedings of the Third AVIRIS Workshop, Pasadena, CA, Jet Propulsion Laboratory, 1991, JPL Publication 91-28 pp. 4-13.
2. A. Brieden, P. Gritzmann, V. Klee, Oracle-polynomial-time approximation of smallest simplices containing convex bodies, Manuscript, 1999.
3. Brieden A., Gritzmann P., Klee V. Inapproximability of some geometric and quadratic optimization problems. Pardalos P.M. Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. 2000;96-115 Kluwer Academic, Dordrecht.
4. Brieden A., Gritzmann P., Klee V. Oracle-polynomial-time approximation of largest simplices in convex bodies. Discrete Math. 221:2000;79-92.
5. Chandran S., Mount D. A parallel algorithm for enclosed and enclosing triangles. Intern. J. Comput. Geom. Appl. 2:1992;191-214.
6. Garey M.R., Johnson D.S. Computers and Intractibility: A Guide to the Theory of. ℕℙ-Completeness:1979;W. H. Freeman and Company, New York.
7. Goetz A.F.H. Imaging spectrometry for earth remote sensing. Toselli F., Bodechtel J. Imaging Spectroscopy: Fundamentals and Prospective Applications. 1992;1-19 Kluwer Academic, Dordrecht.
8. Gritzmann P., Klee V. Computational complexity of inner and outer j -radii of polytopes in finite-dimensional normed spaces Math. Program. 59:1993;163-213.
9. Gritzmann P., Klee V. On the complexity of some basic problems in computational convexity. I. containment problems Discrete Math. 136:1994;129-174.
10. Gritzmann P., Klee V., Larman D. Largest. j -simplices in n -polytopes Discrete Comput. Geom. 13:1995;477-515.
11. Horn R.A., Johnson C.R. Matrix Analysis. 1985;Cambridge University Press, Cambridge.
12. Hudelson M., Klee V., Larman D. Largest. j -simplices in d -cubes Some relatives of the hadamard maximum determinant problem Linear Algebra Appl. 241-243:1996;519-598.
13. Jansen T. Introduction to the theory of complexity and approximation algorithms. Mayr E.W., Prömel H.J., Steger A. Lectures on Proof Verification and Approximation Algorithms. Lecture Notes in Computer Science. Vol. 1367:1998;5-28 Springer, Berlin.
14. Klee V., Laskowski M. Finding the smallest triangle containing a given convex polygon. J. Algorithms. 6:1985;359-375.
15. Lassak M. Parallelotopes of maximum volume in a simplex. Discrete Comput. Geom. 21:1999;449-462.
16. Leng G., Zhang Y., Ma B. Largest parallelotopes contained in simplices. Discrete Math. 211:2000;111-123.
17. n Linear Algebra Appl. 171:1992;81-98.
18. O'Rourke J., Aggarwal A., Maddila A., Baldwin A. An optimal algorithm for finding minimal enclosing triangles. J. Algorithms. 7:1986;258-269.
19. A. Packer, On certain optimal containment problems involving convex sets, Ph.D. Thesis, University of Washington, Seattle, WA, 2001.
20. Packer A. ℕℙ -hardness of largest contained and smallest containing simplices for V- and H -polytopes Discrete Comput. Geom. 28:2002;349-377.
21. Renner R. The resolution of a compositional data set into mixtures of fixed source compositions. Appl. Statist. 42:1993;615-631.
22. G. Vegter, C. Yap, Minimal circumscribing simplices, Proceedings of the Third Canadian Conference on Computational Geometry, Vancouver, Canada, 1991, pp. 58-91.
23. M. Wolbers, 1998, Personal communication, cited in [2].
24. Ye Y. Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84:1999;219-226.
25. 3, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, New York, ACM, 2000, pp. 500-509.