Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope

Information Processing Letters

Volumn 100, Issue 1, 2006, Pages 8-13

  Koutis, Ioannis ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Computational complexity; Computational geometry; Inapproximability; Parameterized computation

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL GEOMETRY; POLYNOMIAL APPROXIMATION;

INAPPROXIMABILITY; J-SIMPLEX; N-DIMENSIONAL POLYTOPE; PARAMETERIZED COMPUTATION;

COMPUTATIONAL COMPLEXITY;

EID: 33745662129     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.05.006     Document Type: Article

References (14)

1. Blumenthal L.M. Theory and Applications of Distance Geometry (1953), Clarendon Press, Oxford
2. Brieden A. Geometric optimization problems likely not contained in APX. Discrete Comput. Geom. 28 (2002) 201-209
3. Brieden A., Gritzmann P., Kannan R., Klee V., Lovász L., and Simonovits M. Approximation of diameters: Randomization does not help. FOCS'98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Washington, DC, USA (1998), IEEE Computer Society, Silver Spring, MD 244
4. Brieden A., Gritzmann P., and Klee V. Oracle-polynomial-time approximation of largest simplices in convex bodies. Discrete Math. 221 1-3 (2000) 79-92
5. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer, Berlin
6. Fiedler M. Matrices and graphs in Euclidean geometry. Electron. J. Linear Algebra 14 (2005) 51-58
7. Gritzmann P., Klee V., and Larman D.G. Largest j-simplices in n-polytopes. Discrete Comput. Geometry 13 (1995) 477-515
8. E. Hazan, M. Safra, O. Schwartz, On the complexity of approximating k-set packing, in: Proceedings of the 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, 2003
9. Horn R.A., and Johnson C.R. Matrix Analysis (1985), Cambridge University Press, Cambridge
10. Horn R.A., and Johnson C.R. Topics in Matrix Analysis (1991), Cambridge University Press, Cambridge
11. Packer A. NP-hardness of largest contained and smallest containing simplices for V- and H-polytopes. Discrete Comput. Geom. 28 (2002) 349-377
12. Packer A. Polynomial-time approximation of largest simplices in V-polytopes. Discrete Appl. Math. 134 1-3 (2004) 213-237
13. M'Laren D., and Sommerville Y. An Introduction to the Geometry of n Dimensions (1958), Dover, New York
14. Stewart G.W., and Sun J.-G. Matrix Perturbation Theory (1990), Academic Press, Boston