{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:39:20Z","timestamp":1773250760426,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00454-013-9528-7","type":"journal-article","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T18:53:32Z","timestamp":1374692012000},"page":"520-535","source":"Crossref","is-referenced-by-count":22,"title":["Approximating Tverberg Points in Linear Time for Any Fixed Dimension"],"prefix":"10.1007","volume":"50","author":[{"given":"Wolfgang","family":"Mulzer","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,25]]},"reference":[{"key":"9528_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sharir, M., Welzl, E.: Algorithms for center and Tverberg points. ACM Trans. Algorithms 5(1), Art. 5 (2009)","DOI":"10.1145\/1435375.1435380"},{"key":"9528_CR2","unstructured":"Chan, T.M.: An optimal randomized algorithm for maximum Tukey depth. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 430\u2013436 (2004)"},{"key":"9528_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method: Randomness and Complexity","author":"B Chazelle","year":"2000","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, Cambridge, MA (2000)"},{"issue":"3","key":"9528_CR4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1142\/S021819599600023X","volume":"6","author":"KL Clarkson","year":"1996","unstructured":"Clarkson, K.L., Eppstein, D., Miller, G.L., Sturtivant, C., Teng, S.-H.: Approximating center points with iterated Radon points. Int. J. Comput. Geom. Appl. 6(3), 357\u2013377 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9528_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"key":"9528_CR6","doi-asserted-by":"crossref","unstructured":"Danzer, L., Gr\u00fcnbaum, B., Klee, V.: Helly\u2019s theorem and its relatives. In: Proceedings of the Symposium on Pure Mathematics, vol. VII, pp. 101\u2013180. American Mathematical Society, Providence (1963)","DOI":"10.1090\/pspum\/007\/0157289"},{"key":"9528_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":"Edelsbrunner, H.: Algorithms in Combinatorial Geometry. Springer, Berlin (1987)"},{"key":"9528_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, Volume 2 of Algorithms and Combinatorics","author":"M Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, Volume 2 of Algorithms and Combinatorics, 2nd edn. Springer, Berlin (1993)","edition":"2"},{"issue":"3","key":"9528_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF02574382","volume":"12","author":"S Jadhav","year":"1994","unstructured":"Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. Discrete Comput. Geom. 12(3), 291\u2013312 (1994)","journal-title":"Discrete Comput. Geom."},{"key":"9528_CR10","unstructured":"Knauer, C, Tiwary, H.R., Werner, D.: On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), vol. 9, pp. 649\u2013660. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Wadern (2011)"},{"key":"9528_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer, New York (2002)"},{"key":"9528_CR12","unstructured":"Meunier, F., Deza, A.: A further generalization of the colourful Carath\u00e9odory theorem. http:\/\/arxiv\/abs\/1107.3380 (2011)"},{"issue":"8","key":"9528_CR13","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.comgeo.2010.04.006","volume":"43","author":"GL Miller","year":"2010","unstructured":"Miller, G.L., Sheehy, D.R.: Approximate centerpoints with proofs. Comput. Geom. Theory Appl. 43(8), 647\u2013654 (2010)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"9528_CR14","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"9528_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1112\/jlms\/s1-21.4.291","volume":"21","author":"R Rado","year":"1946","unstructured":"Rado, R.: A theorem on general measure. J. Lond. Math. Soc. 21, 291\u2013300 (1946)","journal-title":"J. Lond. Math. Soc."},{"key":"9528_CR16","unstructured":"Rong, G.: On algorithms for the colourful linear programming feasibility problem. McMaster University, Master\u2019s thesis (2012)"},{"key":"9528_CR17","unstructured":"Teng, S.-H.: Points, spheres, and separators: a unified geometric approach to graph partitioning. PhD thesis, School of Computer Science, Carnegie Mellon University (1992)"},{"key":"9528_CR18","doi-asserted-by":"crossref","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. J. Lond. Math. Soc. 41, 123\u2013128 (1966)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9528-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9528-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9528-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T05:56:12Z","timestamp":1563515772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9528-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,25]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9528"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9528-7","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,25]]}}}