Abstract
This tutorial is aiming at some randomized approaches for geometric optimization that have been developed over the last ten to fifteen years. The methods are simple, sometimes even the analysis is. The simplicity of the methods entails that they use very little of the underlying structure of the problems to tackle, and, as a consequence, they are applicable to a whole range of problems. Most prominently, they have led to new bounds for combinatorial solutions to linear programming. But with little adaption necessary — basically few problem specific primitive operations have to be supplied —the methods can be used for computing smallest enclosing balls of point sets, smallest volume enclosing ellipsoids, the distance between polytopes (given either as convex hulls or as intersection of halfspaces), and for several other problems. If the dimension of the input instance is constant, then several linear time methods are available, and some of them even behave ‘well’ when the dimension grows; at least, no better provable behavior is known. Many of the methods can be interpreted as variants of the simplex algorithm, with appropriately chosen randomized pivot rules.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernard Chazelle, Jiřý Matoušek: On linear-time deterministic algorithms for optimization problems in fixed dimensions, J. Algorithms 21 (1996), 579–597.
Kenneth L. Clarkson: A Las Vegas algorithm for linear and integer programming when the dimension is small, J. Assoc. Comput. Mach. 42(2) (1995), 488–499.
Martin E. Dyer: Linear algorithms for two and three-variable linear programs, SIAM J. Comput. 13 (1984), 31–45.
Martin E. Dyer: On a multidimensional search technique and its application to the Euclidean one-center problem, SIAM J. Comput. 15 (1986), 725–738.
Jürgen Eckhoff: Helly, Radon, and Carathéodory type theorems, in Handbook of Convex Geometry (P.M Gruber, J.M Wills, eds.), Vol. A (1993), 389–448, North Holland.
Bernd Gärtner, Michael Hoffmann, Sven Schönherr: Geometric optimization, Manual of the Computational Geometry Algorithms Library (CGAL), Release 2.2 (http://www.cgal.org) (2000).
Bernd Gärtner, Sven Schönherr: An efficient, exact, and generic quadratic programming solver for geometric optimization, Proc. 16th Ann. ACM Symp. Computational Geometry (2000), 110–118.
Bernd Gärtner: A subexponential algorithm for abstract optimization problems, SIAM J. Comput. 24 (1995), 1018–1035.
Bernd Gärtner, Emo Welzl: Linear Programming-Randomization and abstract frameworks, Proc. 13th Ann. ACM Symp. Theoretical Aspects of Computer Science (1996), 669–687.
Bernd Gärtner, Emo Welzl: LP-type problems of the second kind for primal-dual methods, manuscript, in preparation (2001).
Ronald L.Graham, Donald E. Knuth, Oren Patashnik: Concrete Mathematics; A Foundation for Computer Science, Addison-Wesley (1989).
Gil Kalai: Linear programming, the simplex algorithm and simple polytopes, Math. Programming 79 (1997), 217–233.
Gil Kalai: A subexponential randomized simplex algorithm, Proc. 24th Ann. ACM Symp. Theory of Computing (1992), 475–482.
Jiřý Matoušek, Micha Sharir, Emo Welzl: A subexponential bound for linear programming, Algorithmica 16 (1996), 498–516.
Nimrod Megiddo: Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach. 31 (1984), 114–127.
Rajeev Motwani, Prabhakar Raghavan: Randomized Algorithms, Cambridge University Press (1995).
Raimund Seidel: Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991), 423–434.
James Joseph Sylvester: A question in the geometry of situation, Quart. J. Math. 1 (1857), 79.
Emo Welzl: Smallest enclosing disks (balls and ellipsoids), in “New Results and New Trends in Computer Science”, (H. Maurer, ed.), Lecture Notes in Computer Science 555 (1991), 359–370.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gärtner, B., Welzl, E. (2001). Explicit and Implicit Enforcing - Randomized Optimization. In: Alt, H. (eds) Computational Discrete Mathematics. Lecture Notes in Computer Science, vol 2122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45506-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-45506-X_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42775-9
Online ISBN: 978-3-540-45506-6
eBook Packages: Springer Book Archive