An improved algorithm for approximating the radii of point sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 178-187

  Ye, Yinyu ^a   Zhang, Jiawei ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GEOMETRY; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

EUCLIDEAN DISTANCE; JOHNSON-LINDENSTRAUSS LEMMATA; PERFORMANCE GUARANTEES; POINT SET; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; RANDOMIZED ROUNDING; SEMI-DEFINITE PROGRAMMING RELAXATIONS;

APPROXIMATION ALGORITHMS;

EID: 33646713872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_16     Document Type: Article

References (20)

1. 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.
2. M. Bǎdoiu, S. Har-Peled and P. Indyk, "Approximate Clustering via Core-sets," In Proc. ACM Symp. Theory of Computing, 2002.
3. D. Bertsimas and Y. Ye, "Semidefinite relaxations, multivariate normal distributions, and order statistics," Handbook of Combinatorial Optimization (Vol. 3), D.-Z. Du and P.M. Pardalos (Eds.) pp. 1-19, (1998 Kluwer Academic Publishers).
4. H.L. Bodlaender, P. Gritzmann, V. Klee and J. Van Leeuwen, "The Computational Complexity of Norm Maximization", Combinatorica, 10: 203-225, 1990.
5. 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, 96-115, Kluwer, 2000.
6. 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.
7. 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., 244-251, 1998.
8. A. Brieden, "Geometric Optimization Problems Likely Not Contained in APX," Discrete Comput. Geom., 28:201-209, 2002.
9. n," Mathematical Programming, 73:1-5, 1996.
10. 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:1115-1145, 1995.
11. 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.
12. P. Gritzmann and V. Klee, "Computational Complexity of Inner and Outer j-Radii of Polytopes in Finite-Dimenional Normed Spaces," Math. Program., 59:162-213, 1993.
13. P. Gritzmann and V. Klee, "On the Complexity of Some basic Problems in Computational Convexity: I. Containment Problems," Discrete Math., 136:129-174, 1994.
14. S. Har-Peled and K.R. Varadarajan, "Approximate Shape Fitting via Linearization," In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., 66-73, 2001.
15. S. Har-Peled and K. Varadarajan, "Projective Clustering in High Dimensions Using Core-sets," In Proc. ACM Symp. Comput. Geom., 2002.
16. S. Har-Peled and K. Varadarajan, "High-Dimensional Shap Fitting in Linear Time," In Proc. ACM Symp. Comput. Geom., 2003.
17. W.B. Johnson and J. Lindenstrauss, "Extensions of Lipshitz Mapping into Hilbert Space," Comtemporary Mathematics, 26:189-206, 1984.
18. A. Nemirovskii, C. Roos and T. Terlaky, "On Maximization of Quadratic Forms Over Intersection of Ellipsoids with Common Center," Math. Program., 86:463-473, 1999.
19. Yu. Nesterov, "Global Quadratic Optimization via Conic Relaxation," In eds H. Wolkowicz, R. Saigal and L. Vandenberghe, "Handbook of Semidefinite Programming Theory, Algorithms, and Applications", Kluwer Academic Publishers, Norwell, MA 02061 USA, 2000.
20. K. Varadarajan, S. Venkatesh and J. Zhang, "On Approximating the Radii of Point Sets in High Dimensions," In Proc. 43rd Annu. IEEE Sympos. Found. Comput. Sci., 2002.