{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:48Z","timestamp":1725490188426},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540427759"},{"type":"electronic","value":"9783540455066"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45506-x_3","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T14:36:53Z","timestamp":1188311813000},"page":"25-46","source":"Crossref","is-referenced-by-count":4,"title":["Explicit and Implicit Enforcing - Randomized Optimization"],"prefix":"10.1007","author":[{"given":"Bernd","family":"G\u00e4rtner","sequence":"first","affiliation":[]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B. Chazelle","year":"1996","unstructured":"Bernard Chazelle, Ji\u0159\u00fd Matou\u0161ek: On linear-time deterministic algorithms for optimization problems in fixed dimensions, J. Algorithms 21 (1996), 579\u2013597.","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR2","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"K. L. Clarkson","year":"1995","unstructured":"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\u2013499.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M. E. Dyer","year":"1984","unstructured":"Martin E. Dyer: Linear algorithms for two and three-variable linear programs, SIAM J. Comput. 13 (1984), 31\u201345.","journal-title":"SIAM J. Comput."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"M. E. Dyer","year":"1986","unstructured":"Martin E. Dyer: On a multidimensional search technique and its application to the Euclidean one-center problem, SIAM J. Comput. 15 (1986), 725\u2013738.","journal-title":"SIAM J. Comput."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"J\u00fcrgen Eckhoff: Helly, Radon, and Carath\u00e9odory type theorems, in Handbook of Convex Geometry (P.M Gruber, J.M Wills, eds.), Vol. A (1993), 389\u2013448, North Holland.","DOI":"10.1016\/B978-0-444-89596-7.50017-1"},{"key":"3_CR6","unstructured":"Bernd G\u00e4rtner, Michael Hoffmann, Sven Sch\u00f6nherr: Geometric optimization, Manual of the Computational Geometry Algorithms Library (CGAL), Release 2.2 ( http:\/\/www.cgal.org ) (2000)."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Bernd G\u00e4rtner, Sven Sch\u00f6nherr: An efficient, exact, and generic quadratic programming solver for geometric optimization, Proc. 16th Ann. ACM Symp. Computational Geometry (2000), 110\u2013118.","DOI":"10.1145\/336154.336191"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1137\/S0097539793250287","volume":"24","author":"B. G\u00e4rtner","year":"1995","unstructured":"Bernd G\u00e4rtner: A subexponential algorithm for abstract optimization problems, SIAM J. Comput. 24 (1995), 1018\u20131035.","journal-title":"SIAM J. Comput."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Bernd G\u00e4rtner, Emo Welzl: Linear Programming-Randomization and abstract frameworks, Proc. 13th Ann. ACM Symp. Theoretical Aspects of Computer Science (1996), 669\u2013687.","DOI":"10.1007\/3-540-60922-9_54"},{"key":"3_CR10","unstructured":"Bernd G\u00e4rtner, Emo Welzl: LP-type problems of the second kind for primal-dual methods, manuscript, in preparation (2001)."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Ronald L.Graham, Donald E. Knuth, Oren Patashnik: Concrete Mathematics; A Foundation for Computer Science, Addison-Wesley (1989).","DOI":"10.1063\/1.4822863"},{"key":"3_CR12","first-page":"217","volume":"79","author":"G. Kalai","year":"1997","unstructured":"Gil Kalai: Linear programming, the simplex algorithm and simple polytopes, Math. Programming 79 (1997), 217\u2013233.","journal-title":"Math. Programming"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Gil Kalai: A subexponential randomized simplex algorithm, Proc. 24th Ann. ACM Symp. Theory of Computing (1992), 475\u2013482.","DOI":"10.1145\/129712.129759"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J. Matou\u0161ek","year":"1996","unstructured":"Ji\u0159\u00fd Matou\u0161ek, Micha Sharir, Emo Welzl: A subexponential bound for linear programming, Algorithmica 16 (1996), 498\u2013516.","journal-title":"Algorithmica"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Nimrod Megiddo: Linear programming in linear time when the dimension is fixed, J. Assoc. Comput. Mach. 31 (1984), 114\u2013127.","journal-title":"J. Assoc. Comput. Mach"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Rajeev Motwani, Prabhakar Raghavan: Randomized Algorithms, Cambridge University Press (1995).","DOI":"10.1017\/CBO9780511814075"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/BF02574699","volume":"6","author":"R. Seidel","year":"1991","unstructured":"Raimund Seidel: Small-dimensional linear programming and convex hulls made easy, Discrete Comput. Geom. 6 (1991), 423\u2013434.","journal-title":"Discrete Comput. Geom"},{"key":"3_CR18","first-page":"79","volume":"1","author":"J. J. Sylvester","year":"1857","unstructured":"James Joseph Sylvester: A question in the geometry of situation, Quart. J. Math. 1 (1857), 79.","journal-title":"Quart. J. Math"},{"key":"3_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BFb0038202","volume-title":"New Results and New Trends in Computer Science","author":"E. Welzl","year":"1991","unstructured":"Emo Welzl: Smallest enclosing disks (balls and ellipsoids), in \u201cNew Results and New Trends in Computer Science\u201d, (H. Maurer, ed.), Lecture Notes in Computer Science 555 (1991), 359\u2013370."}],"container-title":["Lecture Notes in Computer Science","Computational Discrete Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45506-X_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:09:18Z","timestamp":1556816958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45506-X_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540427759","9783540455066"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45506-x_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}