Approximating the radii of point sets

SIAM Journal on Computing

Volumn 36, Issue 6, 2007, Pages 1764-1776

  Varadarajan, Kasturi ^a   Venkatesh, S ^b   Ye, Yinyu ^c   Zhang, Jiawei ^d  

^a University of Iowa   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

^c Stanford University   (United States)

^d NEW YORK UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Computational convexity; Semidefinite programming

Indexed keywords

COMPUTATIONAL CONVEXITY; SEMIDEFINITE PROGRAMMING;

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS;

EID: 37849009407     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050627472     Document Type: Article

References (28)

1. D. ACHLIOPTAS AND F. MCSHERRY, Fast computation of low rank matrix approximations, in Proceedings of the ACM Symposium on the Theory of Computing, 2001.
2. P. K. AGARWAL, S. HAR-PELED, AND K. R. VARADARAJAN, Approximating extent measures of points, J. ACM, 51 (2004), pp. 606-635.
3. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555.
4. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122.
5. Y. AZAR, A. FIAT, A. KARLIN, F. MCSHERRY, AND J. SAIA, Spectral analysis of data, in Proceedings of the ACM Symposium on the 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 (2001), pp. 91-109.
7. M. BǍDOIU, S. HAR-PELED, AND P. INDYK, Approximate clustering via core-sets, in Proceedings of the ACM Symposium on the Theory of Computing, 2002.
8. M. BELLARE AND P. ROGAWAY, The complexity of approximating a nonlinear program, Math. Program. B, 69 (1995), pp. 429-441.
9. D. BERTSIMAS AND Y. YE, Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics, Handbook Combin. Optim. 3, D.-Z. Du and P. M. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA, 1998, pp. 1-19.
10. H. L. BODLAENDER, P. GRITZMANN, V. KLEE, AND J. VAN LEEUWEN, The computational complexity of norm maximization, Combinatorica, 10 (1990), pp. 203-225.
11. A. BRIEDEN, P. GRITZMANN, AND V. KLEE, Inapproximability of some geometric and quadratic optimization problems, in Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P. M. Pardalos, ed., Kluwer Academic Publishers, Norwell, MA, 2000, pp. 96-115.
12. A. BRIEDEN, P. GRITZMANN, R. KANNAN, V. KLEE, L. LOVASZ, AND M. SIMONOVITS, Deterministic and randomized polynomial-time approximation of radii, Mathematika, 48 (2001), pp. 63-105.
13. A. BRIEDEN, P. GRITZMANN, R. KANNAN, V. KLEE, L. LOVASZ, AND M. SIMONOVITS, Approximation of diameters: Randomization doesn't help, in Proceedings of the IEEE Symposium on the Foundations of Computer Science, 1998, pp. 244-251.
14. A. BRIEDEN, Geometric optimization problems likely not contained in APX, Discrete Comput. Geom., 28 (2002), pp. 201-209.
15. n, Math. Program., 73 (1996), pp. 1-5.
16. U. FEIGE, A threshold ln n for approximating set cover, J. ACM, 45 (1998), pp. 634-652.
17. A. FRIEZE, R. KANNAN, AND S. VBMPALA, Fast Monte-Carlo algorithms for finding low rank approximations, J. ACM, 51 (2004), pp. 1025-1041.
18. M. X. GOEMANS AND D. P. WILLIAMSON, Improved approximation algorithms for maximum cut and satisfiability problems using semi-definite programming, J. ACM, 42 (1995), pp. 1115-1145.
19. P. GRITZMANN AND V. KLEE, Inner and outer j-radii of convex bodies in finite-dimensional normed spaces, Discrete Comput. Geom., 7 (1992), pp. 255-280.
20. P. GRITZMANN AND V. KLEE, Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces, Math. Program., 59 (1993), pp. 162-213.
21. P. GRITZMANN AND V. KLEE, On the complexity of some basic problems in computational convexity: I. Containment problems, Discrete Math., 136 (1994), pp. 129-174.
22. S. HAR-PELED AND K. VARADARAJAN, Projective clustering in high dimensions using core-sets, in Proceedings of the 18th Annual Symposium on Computational Geometry, ACM Press, 2002, pp. 312-318.
23. S. HAR-PELED AND K. VARADARAJAN, High-dimensional shape fitting in linear time, Discrete Comput. Geom., 32 (2004), pp. 269-288.
24. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
25. N. MEGIDDO, On the complexity of some geometric problems in unbounded dimension, J. Symbolic Comput., 10 (1990), pp. 327-334.
26. A. NEMIROVSKI, C. ROOS, AND T. TERLAKY, On maximization of quadratic forms over intersection of ellipsoids with common center, Math. Program., 86 (1999), pp. 463-473.
27. YU. NESTEROV, Global quadratic optimization via conic relaxation, in Handbook of Semidefinite Programming Theory, Algorithms, and Applications, H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Kluwer Academic Publishers, Norwell, MA, 2000.
28. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803.