Deterministic and randomized polynomial-time approximation of RADII

Mathematika

Volumn 48, Issue 1-2, 2001, Pages 63-105

  Brieden, Andreas ^a   Gritzmann, Peter ^a   Kannan, Ravindran ^b   Klee, Victor ^c   Lovász, László ^d   Simonovits, Miklós ^e  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b Yale University   (United States)

^c UNIVERSITY OF WASHINGTON   (United States)

^d MICROSOFT RESEARCH   (United States)

^e ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21144446845     PISSN: 00255793     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0025579300014364     Document Type: Article

References (53)

1. [BF87] I. Bárány and Z. Füredi. Computing the volume is difficult. Discrete Comput. Geom., 2 (1987), 319-326.
2. [BF88] I. Bárány and Z. Füredi. Approximation of the sphere by polytopes having few vertices. Proc. Amer. Math. Soc., 102 (1988), 651-659.
3. [BG97] A. Brieden and P. Gritzmann. On Helly's theorem: algorithms and extensions. Discrete Comput. Geom., 17 (1997), 393-410.
4. +98] A. Brieden, P. Gritzmann, R. Kannan, V. Klee, L. Lovász and M. Simonovits. Approximation of radii and norm-maxima: Randomization doesn't help. Proc. 39th Sympos. FOCS, IEEE (1998), 244-251.
5. [BGK99] A. Brieden, P. Gritzmann and V. Klee. Inapproximability of some geometric and quadratic optimization problems. Approximation and Complexity in Numerical Optimization (ed. P. M. Pardalos). Kluwer (Boston, 2000), 96-115.
6. [BGKL90] H. L. Bodlaender, P. Gritzmann, V. Klee and J. van Leeuwen. Computational complexity of norm-maximization. Combinatorica, 10 (1990), 203-225.
7. [BP90] K. Ball and A. Pajor. Convex bodies with few faces. Proc. Amer. Math. Soc., 110 (1990), 225-231.
8. [Bri98] A. Brieden. Deterministic Approximation Algorithms in Computational Convexity, PhD thesis (Tech. Univ. Munich, 1998).
9. [Car85] B. Carl. Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces. Ann. l'Inst. Fourier, 35 (1985), 79-118.
10. [CP88] B. Carl and A. Pajor. Gelfand numbers of operators with values in a Hubert space. Invent. Math., 94 (1988), 479-504.
11. [DF88] M. Dyer and A. Frieze. On the complexity of computing the volume of a polytope. SIAM J. Comput., 17 (1988), 967-974.
12. [DFK89] M. Dyer, A. Frieze and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. Proc. 21st ACM Sympos. Theory Comput. (1989), 375-381.
13. [DGK63] L. Danzer, B. Grünbaum and V. Klee. Helly's theorem and its relatives. Proc. Sympos. Pure Math., 7 (1963), 101-180.
14. [Dud94] S. I. Dudov. An inner bound of a convex set by a norm body. Comput. Math. Math. Physics, 36 (1994), 683-688.
15. [Ele86] G. Elekes. A geometric inequality and the complexity of computing volume. Discrete Comput. Geom., 1 (1986), 289-292.
16. [FO85] R. M. Freund and J. B. Orlin. On the complexity of four polyhedral set containment problems. Math. Programming, 33 (1985), 139-145.
17. [Gil77] J. Gill. Computational complexity of probabilistic Turing machines. SIAM J. Comput., 6 (1977), 675-695.
18. [GJ79] M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
19. [GK92] P. Gritzmann and V. Klee. Inner and outer j-radii of convex bodies in finite-dimensional normed spaces. Discrete Comput. Geom., 7 (1992), 255-280.
20. [GK93] P. Gritzmann and V. Klee. Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces. Math. Programming, 59 (1993), 163-213.
21. [GK94] P. Gritzmann and V. Klee. On the complexity of some basic problems in computational convexity: I. Containment problems. Discrete Math., 136 (1994), 129-174.
22. [GLS93] M. Grötschel, L. Lovász and A. Schrijver. Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988, 1993).
23. [GMR94] Y. Gordon, M. Meyer and S. Reisner. Volume approximation of convex bodies - a constructive method. Studio Math., 111 (1994) 81-95.
24. [GMR95] Y. Gordon, M. Meyer and S. Reisner. Constructing a polytope to approximate a convex body. Geom. Dedicata, 57 (1995), 217-222.
25. [Gru93] P. M. Gruber. Aspects of approximation of convex bodies. Handbook of Convex Geometry. P. M. Gruber and J. M. Wills, eds. (Elsevier, Amsterdam, 1993), 319-345.
26. [HJ74] J. Hoffmann-Jorgensen. Sums of independent Danach space valued random variables. Studia Math., 52 (1974), 159-186.
27. [HJP76] J. Hoffman-Jørgensen and G. Pisier. The law of large numbers and the central limit theorem in Banach spaces. Ann. Probab., 4 (1976), 587-599.
28. [Jan98] T. Jansen. Introduction to the theory of complexity and approximation algorithms. In Mayr et al. [MPS98], 5-28.
29. [Jun01] H. W. E. Jung. Über den kleinsten Kreis, der eine ebene Figur einschließt. J. Reine Angew. Math., 130 (1901), 310-313.
30. [JW86] M. R. Jerrum, L. G. Valiant and V. V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci., 43 (1986), 169-188.
31. [Kah68] J.-P. Kahane. Some Random Series of Functions (Heath, Cambridge, 1968; 2nd edition, Cambridge University Press, 1985).
32. [Kha79] L. G. Khachiyan. Polynomial algorithms in linear programming. Dokl. Akad. Nauk SSSR, 244 (1979), 1093-1096. (Russian);
33. English translation: Doklady Mathematics, 20 (1979), 191-194.
34. [Kha88] L. G. Khachiyan. On the complexity of computing the volume of a polytope. Izv. Akad. Nauk SSSR, Engineering Cybernetics, 3 (1988), 216-217.
35. [Khi23] A. Khintchine. Über dyadische Brüche. Math. Z., 18 (1923), 109-116.
36. 5) volume algorithm for convex bodies. Random Structures Algorithms, 11 (1998), 1-50.
37. [Koc94] M. Kochol. Constructive approximation of a ball by polytopes. Math. Slovaca, 44 (1994), 99-105.
38. [LS92] L. Lovász and M. Simonovits. On the randomized complexity of volume and diameter. Proc. 33rd Sympos. FOCS, IEEE (1992), 482-491.
39. [LT79] J. Lindenstrauss and L. Tzafriri. Classical Banach Spaces II (Springer, Berlin, 1979).
40. [MPS98] E. W. Mayr, H. J. Prömel and A. Steger (eds.). Lectures on Proof Verification and Approximation Algorithms. Lecture Notes in Computer Science, no. 1367 (Springer, 1998).
41. [MS86] V. D. Milman and G. Schechtman. Asymptotic Theory of Finite Dimensional Normed Spaces. Lecture Notes in Mathematics, vol. 1200 (Springer, 1986).
42. [Pie80] A. Pietsch. Operator Ideals (North-Holland, Amsterdam, 1980).
43. [Pis88] G. Pisier. The Volume of Convex Bodies and Banach Space Geometry (Cambridge University Press, 1988).
44. [PY91] C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. System Sci., 43 (1991), 425-440.
45. [Sho77] N. Z. Shor. Cut-off method with space extension in convex programming problems. Kibernetika, 1977 (1977), no. 1, 94-95;
46. English translation: Cybernetics, 13 (1977), 94-96.
47. [Ste22] P. Steinhagen. Über die größte Kugel in einer konvexen Punktmenge. Abh. Math. Sem. Univ. Hamburg (1922), 15-22.
48. [SY92] J. R. Seberry and M. Yamada. Hadamard matrices, sequences, and block designs. Contemporary Design Theory - A Collection of Surveys (North Holland, New York, 1992), 431-560.
49. [Sy167] J. J. Sylvester. Thoughts on inverse orthogonal matrices, simultaneous sign-successions, and tessellated pavements in two or more colours, with applications to Newton's rule, ornamental tile work, and the theory of numbers. Philos. Magazine, 34 (1867), 461-475.
50. [TJ88] N. Tomczak-Jaegermann. Banach-Mazur Distances and Finite-Dimensional Operator Ideals (Longman Scientific & Technical, 1988).
51. [Vaa79] J. D. Vaaler. A geometric inequality with applications to linear forms. Pacific J. Math., 83 (1979), 543-553.
52. [YN76] B. D. Yudin and A. S. Nemirovskii. Informational complexity and efficient methods for the solution of convex extremal problems. Ekonomika i Mat. Melody, 12 (1976), 357-369;
53. English translation: Matekon, 13, 25-45.