Approximating the centroid is hard

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 302-305

  Rademacher, Luis A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Approximation; Centroid; Completeness; Convex body; Hardness

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA;

CENTROID; CONVEX BODY;

PROBLEM SOLVING;

EID: 35348888345     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247123     Document Type: Conference Paper

References (8)

1. I. Bárány and Z. Füredi. Computing the volume is difficult. Discrete & Computational Geometry, 2:319-326, 1987.
2. D. Bertsimas and S. Vempala. Solving convex programs by random walks. J. ACM, 51(4):540-556, 2004.
3. G. Brightwell and P. Winkler. Counting linear extensions. Order, 8(3):225-242, 1991.
4. M. J. Kaiser, T. L. Morin, and T. B. Trafalis. Centers and invariant points of convex bodies. In Applied geometry and discrete mathematics, volume 4 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 367-385. Amer. Math. Soc., Providence, RI, 1991.
5. J. Lawrence. Polytope volume computation. Mathematics of Computation, 57(195):259-271, 1991.
6. L. Lovasz and S. Vempala. Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization. Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)-Volume 00, pages 57-68, 2006.
7. L. Lovász and S. Vempala. The geometry of logconcave functions and sampling algorithms. Random Structures and Algorithms, 2006. To appear.
8. L. Rademacher and S. Vempala. Dispersion of mass and the complexity of randomized geometric algorithms. In FOCS '06: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pages 729-738, Washington, DC, USA, 2006. IEEE Computer Society.