{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:29:22Z","timestamp":1773145762133,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642450297","type":"print"},{"value":"9783642450303","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_28","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T21:32:52Z","timestamp":1386797572000},"page":"295-305","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms for Tolerated Tverberg Partitions"],"prefix":"10.1007","author":[{"given":"Wolfgang","family":"Mulzer","sequence":"first","affiliation":[]},{"given":"Yannik","family":"Stein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Chan, T.M.: An optimal randomized algorithm for maximum Tukey depth. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 430\u2013436 (2004)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S021819599600023X","volume":"6","author":"K.L. Clarkson","year":"1996","unstructured":"Clarkson, K.L., Eppstein, D., Miller, G.L., Sturtivant, C., Hua Teng, S.: Approximating center points with iterative Radon points. International Journal of Computational Geometry & Applications\u00a06, 357\u2013377 (1996)","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"28_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"key":"28_CR4","unstructured":"Garc\u00eda Col\u00edn, N.: Applying Tverberg Type Theorems to Geometric Problems. PhD thesis, University College London (2007)"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1112\/blms\/4.1.6","volume":"4","author":"D. Larman","year":"1972","unstructured":"Larman, D.: On sets projectively equivalent to the vertices of a convex polytope. Bulletin of the London Mathematical Society\u00a04(1), 6\u201312 (1972)","journal-title":"Bulletin of the London Mathematical Society"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry, 1st edn. Springer (2002)","DOI":"10.1007\/978-1-4613-0039-7_1"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.comgeo.2010.04.006","volume":"43","author":"G.L. Miller","year":"2010","unstructured":"Miller, G.L., Sheehy, D.R.: Approximate centerpoints with proofs. Computational Geometry\u00a043, 647\u2013654 (2010)","journal-title":"Computational Geometry"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/s00454-010-9296-6","volume":"45","author":"L. Montejano","year":"2011","unstructured":"Montejano, L., Oliveros, D.: Tolerance in Helly-type theorems. Discrete & Computational Geometry\u00a045, 348\u2013357 (2011)","journal-title":"Discrete & Computational Geometry"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Mulzer, W., Werner, D.: Approximating Tverberg points in linear time for any fixed dimension. In: Proceedings of the 28th Annual Symposium on Computational Geometry, pp. 303\u2013310 (2012)","DOI":"10.1145\/2261250.2261294"},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1112\/jlms\/s1-21.4.291","volume":"1","author":"R. Rado","year":"1946","unstructured":"Rado, R.: A theorem on general measure. Journal of the London Mathematical Society\u00a01, 291\u2013300 (1946)","journal-title":"Journal of the London Mathematical Society"},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF02808223","volume":"79","author":"K. Sarkaria","year":"1992","unstructured":"Sarkaria, K.: Tverberg\u2019s theorem via number fields. Israel Journal of Mathematics\u00a079, 317\u2013320 (1992)","journal-title":"Israel Journal of Mathematics"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/s00454-011-9379-z","volume":"47","author":"P. Sober\u00f3n","year":"2012","unstructured":"Sober\u00f3n, P., Strausz, R.: A generalisation of Tverberg\u2019s theorem. Discrete & Computational Geometry\u00a047, 455\u2013460 (2012)","journal-title":"Discrete & Computational Geometry"},{"key":"28_CR13","unstructured":"Teng, S.-H.: Points, spheres, and separators: a unified geometric approach to graph partitioning. PhD thesis, Carnegie Mellon University Pittsburgh (1992)"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1112\/jlms\/s1-41.1.123","volume":"41","author":"H. Tverberg","year":"1966","unstructured":"Tverberg, H.: A generalization of Radon\u2019s theorem. Journal of the London Mathematical Society\u00a041, 123\u2013128 (1966)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T06:28:27Z","timestamp":1558765707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}