{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:07:12Z","timestamp":1725494832248},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662792"},{"type":"electronic","value":"9783540484479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_1","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:42:14Z","timestamp":1194972134000},"page":"1-12","source":"Crossref","is-referenced-by-count":8,"title":["Optimization over k-set Polytopes and Efficient k-set Enumeration"],"prefix":"10.1007","author":[{"given":"Artur","family":"Andrzejak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Komei","family":"Fukuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Noga Alon, Imre B\u00e1r\u00e1ny, Zolt\u00e1n F\u00fcredi, and Daniel J. Kleitman. Point selections and weak \u2208-nets for convex hulls. Combinatorics, Probability and Computing, 1992.","DOI":"10.1017\/S0963548300000225"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D. Avis","year":"1996","unstructured":"David Avis and Komei Fukuda. Reverse search for enumeration. Disc. Applied Math., 65:21\u201346, 1996.","journal-title":"Disc. Applied Math"},{"issue":"1-2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","volume":"147","author":"E. Amaldi","year":"1995","unstructured":"E. Amaldi and V. Kann. The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Science, 147(1-2):181\u2013210, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF01293483","volume":"13","author":"P. K. Agarwal","year":"1995","unstructured":"Pankaj K. Agarwal and Ji\u0159\u00ed Matou\u0161ek. Dynamic half-space range reporting and its applications. Algorithmica, 13(4): 325\u2013345, April 1995.","journal-title":"Algorithmica"},{"key":"1_CR5","unstructured":"Artur Andrzejak and Emo Welzl. k-sets and j-facets-A tour of discrete geometry. In preparation, 1997."},{"key":"1_CR6","unstructured":"Artur Andrzejak and Emo Welzl. Relations between numbers of k-sets and numbers of j-facets. In preparation, 1997."},{"key":"1_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer-Verlag Berlin Heidelberg, New York, 1987."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/PL00009291","volume":"17","author":"H. Edelsbrunner","year":"1997","unstructured":"Herbert Edelsbrunner, Pavel Valtr, and Emo Welzl. Cutting dense point sets in half. Discrete Comput. Geom., 17:243\u2013255, 1997.","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1137\/0215019","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"Herbert Edelsbrunner and Emo Welzl. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput., 15(1):271\u2013284, 1986.","journal-title":"SIAM J. Comput."},{"key":"1_CR10","first-page":"135","volume-title":"Algorithms and Combinatorics","author":"N. M. Korneenko","year":"1993","unstructured":"Nikolai M. Korneenko and Horst Martini. Hyperplane Approximations and Related Topics. Pach, J\u00e1nos (ed.): New trends in discrete and computational geometry. Algorithms and Combinatorics v. 10, pages 135\u2013161. Springer-Verlag, Berlin Heidelberg, New York, 1993."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02574692","volume":"6","author":"K. Mulmuley","year":"1991","unstructured":"Ketan Mulmuley. On Levels in Arrangements and Voronoi Diagrams. Discrete Comput. Geom., 6:307\u2013338, 1991.","journal-title":"Discrete Comput. Geom"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-0000(93)90041-T","volume":"47","author":"K. Mulmuley","year":"1993","unstructured":"Ketan Mulmuley. Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements. Journal of Computer and System Sciences, 47(3):437\u2013458, December 1993.","journal-title":"Journal of Computer and System Sciences"},{"key":"1_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1007\/3-540-59042-0_105","volume-title":"Proceedings of 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95)","author":"T. Ottmann","year":"1995","unstructured":"Thomas Ottmann, Sven Schuierer, and Subbiah Soundaralakshmi. Enumerating Extreme Points in Higher Dimensions. Proceedings of 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), Munich, Germany, March 1995, LNCS 900, pages 562\u2013570. Springer-Verlag Berlin Heidelberg, New York, 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48447-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:54:57Z","timestamp":1556952897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}