{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:55:54Z","timestamp":1773510954481,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0843915,1065106,1111109,1122374"],"award-info":[{"award-number":["0843915,1065106,1111109,1122374"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897647","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T09:04:07Z","timestamp":1465549447000},"page":"9-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":71,"title":["Geometric median in nearly linear time"],"prefix":"10.1145","author":[{"given":"Michael B.","family":"Cohen","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Yin Tat","family":"Lee","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Gary","family":"Miller","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Jakub","family":"Pachocki","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}]},{"given":"Aaron","family":"Sidford","sequence":"additional","affiliation":[{"name":"Microsoft Research, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509947"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187906"},{"key":"e_1_3_2_1_3_1","volume-title":"A note on the weiszfeld-kuhn algorithm for the general fermat problem. Managme Sci Res Report, (484):1\u20136","author":"Balas E.","year":"1982","unstructured":"E. Balas and C.-S. Yu. A note on the weiszfeld-kuhn algorithm for the general fermat problem. Managme Sci Res Report, (484):1\u20136, 1982."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(02)00102-5"},{"key":"e_1_3_2_1_5_1","volume-title":"Theory of convex optimization for machine learning. arXiv preprint arXiv:1405.4980","author":"Bubeck S.","year":"2014","unstructured":"S. Bubeck. Theory of convex optimization for machine learning. arXiv preprint arXiv:1405.4980, 2014."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587094"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422469"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90082-1"},{"key":"e_1_3_2_1_9_1","volume-title":"Springer","author":"Drezner Z.","year":"2002","unstructured":"Z. Drezner, K. Klamroth, A. Sch \u02dc A\u02dd ubel, and G. Wesolowsky. Facility location, chapter The Weber problem, pages 1\u201336. Springer, 2002."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993712"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1034048"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064114"},{"key":"e_1_3_2_1_13_1","volume-title":"High-dimensional computational geometry","author":"Indyk P.","year":"2000","unstructured":"P. Indyk and S. U. C. S. Dept. High-dimensional computational geometry. Stanford University, 2000."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/imaman\/8.3.215"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/800089.802880"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584648"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347978"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176347978"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_3_2_1_21_1","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Nesterov Y.","year":"2003","unstructured":"Y. Nesterov. Introductory Lectures on Convex Optimization: A Basic Course, volume I. 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.4.597"},{"key":"e_1_3_2_1_24_1","volume-title":"DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science","author":"Parrilo P. A.","year":"2001","unstructured":"P. A. Parrilo and B. Sturmfels. Minimizing polynomial functions. In DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science, March 12-16, 2001, DIMACS Center, Rutgers University, Piscataway, NJ, USA, pages 83\u2013100, 2001."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-008-0056-1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/2794549.3114257"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.97.4.1423"},{"key":"e_1_3_2_1_28_1","unstructured":"V. Viviani. De maximis et minimis geometrica divinatio liber 2. De Maximis et Minimis Geometrica Divinatio 1659."},{"key":"e_1_3_2_1_29_1","volume-title":"The Theory of the Location of Industries","author":"Weber A.","year":"1909","unstructured":"A. Weber. The Theory of the Location of Industries. Chicago University Press, 1909. Aber den I der Industrien."},{"key":"e_1_3_2_1_30_1","first-page":"386","volume-title":"Tohoku Mathematical Journal","author":"Weiszfeld E.","year":"1937","unstructured":"E. Weiszfeld. Sur le point pour lequel la somme des distances de n points donnes est minimum. Tohoku Mathematical Journal, pages 355\u2013386, 1937."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495288362"},{"key":"e_1_3_2_1_32_1","volume-title":"theory and analysis","author":"Y. Ye.","year":"2011","unstructured":"Y. Ye. Interior point algorithms: theory and analysis, volume 44. John Wiley & Sons, 2011."}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897647","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:41:16Z","timestamp":1763458876000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":32,"alternative-id":["10.1145\/2897518.2897647","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897647","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}