On approximating the radii of point sets in high dimensions

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 561-569

  Varadarajan, Kasturi R ^a   Venkatesh, S ^b   Zhang, Jiawei ^c  

^a University of Iowa   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CALCULATIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; QUADRATIC PROGRAMMING; RANDOM PROCESSES; THEOREM PROVING; TOPOLOGY;

COMPUTATIONAL CONVEXITY; DIMENSION REDUCTION TECHNIQUE; POINT SETS; POLYNOMIAL TIME ALGORITHM; RADII; SEMIDEFINITE PROGRAMMING;

COMPUTATIONAL GEOMETRY;

EID: 0036954433     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. D. Achlioptas and F. McSherry. Fast computation of low rank matrix approximations In Proc. ACM Symp. Theory of Computing, 2001.
2. P.K. Agarwal and C.M. Procopiuc. Approximation algorithms for projective clustering. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pages 538-547, 2000.
3. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Intractability of Approximation Problems. Journal of ACM, 45:3, 1998, 501-555.
4. S. Arora and S. Safra. Probabilistic Checking of Proofs: a new characterization of NP. Journal of ACM, 45:1, 1998, 70-122.
5. Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia. Spectral Analysis of Data. In Proc. ACM Symp. Theory of Computing, 2001.
6. G. Barequet and S. Har-Peled. Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J, Algorithms, 38:91-109, 2001.
7. M. Badoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proc. ACM Symp. Theory of Computing, 2002.
8. M. Bellare and P. Rogoway. The complexity of approximating a nonlinear program. Mathematical Programming B, 69:3, 1995, 429-441.
9. H. L. Bodlaender, P. Gritzmann, V. Klee, and J. van Leeuwen. The computational complexity of norm-maximization Combinatorica 10 (1990) 203-225.
10. A. Brieden, P. Gritzmann, and V. Klee. Inapproximability of some geometric and quadratic optimization problems. In P. M. Pardalos, editor, Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, pages 96-115, Kluwer, 2000.
11. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovasz, and M. Simonovits. Deterministic and randomized polynomial-time approximation of radii. To appear in Mathematika.
12. A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovasz. and M. Simonovits. Approximation of diameters: randomization doesn't help. In Proc. IEEE Symp. Foundations of Comp. Sci., pages 244-251, 1998.
13. A. Brieden. On geometric optimization problems likely not contained in APX. 2002. To appear.
14. n. Mathematical Programming 73:1-5, 1996.
15. A. Frieze, R. Kannan, and S. Vempala Fast Monte-Carlo algorithms for finding low rank approximations. In Proc. IEEE Symp. Foundations of Comput. Sci., 370-378, 1998.
16. M. X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming. Journal of the ACM 42, (1995), 1115-1145.
17. P. Gritzmann and V. Klee. Inner and outer j-radii of convex bodies in finite-dimensional normed spaces. Discrete Comput. Geom., 7:255-280, 1992.
18. P. Gritzmann and V. Klee. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Program., 59:163-213, 1993.
19. P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity: I. Containment problems. Discrete Math., 136:129-174, 1994.
20. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin Heidelberg, 2nd edition, 1998. 2nd eidition 1994.
21. J. Håstad. Some optimal inapproximability results. Journal of ACM 48: 798-859, 2001.
22. S. Har-Peled and K.R. Varadarajan. Approximate shape fitting via linearization. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 66-73, 2001.
23. S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. ACM Symp. Comput. Geom., 2002.
24. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., pages 10-31, 2001.
25. W.B. Johnson and J. Lindenstrauss. Extensions of lipshitz mapping into hilbert space. Contemporary Mathematics, 26:189-206, 1984.
26. N. Megiddo. On the complexity of some geometric problems in unbounded dimension. Journal of Symbolic Computation, 10:327-334, 1990.
27. A. Nemirovski and C. Ross and T. Terlaky. On maximization of quadratic forms over intersection of ellipsoids with common center. Mathematical Programming Ser. A, 86:463-473, 1999.
28. Yu. Nesterov. Global quadratic optimization via conic relaxation. Working paper, CORE, Catholic University of Louvaine, Belgium, 1998.
29. R. Raz. A parallel repetition theorem. SIAM Journal of Computing, 27:3, 1998-763-803.