{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:14:30Z","timestamp":1777374870993,"version":"3.51.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T00:00:00Z","timestamp":1222128000000},"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":[[2008,12]]},"DOI":"10.1007\/s00454-008-9107-5","type":"journal-article","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T20:42:27Z","timestamp":1222116147000},"page":"537-560","source":"Crossref","is-referenced-by-count":7,"title":["Analysis of Incomplete Data and\u00a0an\u00a0Intrinsic-Dimension Helly Theorem"],"prefix":"10.1007","volume":"40","author":[{"given":"Jie","family":"Gao","sequence":"first","affiliation":[]},{"given":"Michael","family":"Langberg","sequence":"additional","affiliation":[]},{"given":"Leonard J.","family":"Schulman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,9,23]]},"reference":[{"key":"9107_CR1","first-page":"538","volume-title":"SODA\u201900: Proceedings of the Eleventh Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"P.K. Agarwal","year":"2000","unstructured":"Agarwal, P.K., Procopiuc, C.M.: Approximation algorithms for projective clustering. In: SODA\u201900: Proceedings of the Eleventh Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, 2000, pp.\u00a0538\u2013547. SIAM, Philadelphia (2000)"},{"key":"9107_CR2","first-page":"54","volume-title":"ESA\u201902: Proceedings of the 10th Annual European Symposium on Algorithms","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M., Varadarajan, K.R.: Approximation algorithms for k-line center. In: ESA\u201902: Proceedings of the 10th Annual European Symposium on Algorithms, London, UK, 2002, pp.\u00a054\u201363. Springer, Berlin (2002)"},{"issue":"2","key":"9107_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0925-7721(03)00017-8","volume":"26","author":"P.K. Agarwal","year":"2003","unstructured":"Agarwal, P.K., Procopiuc, C.M., Varadarajan, K.R.: A\u00a0(1+\u03b5)-approximation algorithm for 2-line-center. Comput. Geom. Theory Appl. 26(2), 119\u2013128 (2003)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"9107_CR4","first-page":"606","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measures of points. J.\u00a0ACM 51(4), 606\u2013635 (2004)","journal-title":"J.\u00a0ACM"},{"key":"9107_CR5","volume-title":"Current Trends in Combinatorial and Computational Geometry","author":"P. Agarwal","year":"2005","unstructured":"Agarwal, P., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Current Trends in Combinatorial and Computational Geometry. Cambridge University Press, Cambridge (2005)"},{"key":"9107_CR6","first-page":"801","volume-title":"SODA\u201903: Proceedings of the Fourteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"M. B\u01cedoiu","year":"2003","unstructured":"B\u01cedoiu, M., Clarkson, K.L.: Smaller core-sets for balls. In: SODA\u201903: Proceedings of the Fourteenth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, 2003, pp.\u00a0801\u2013802. SIAM, Philadelphia (2003)"},{"key":"9107_CR7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/509907.509947","volume-title":"STOC\u201902: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing","author":"M. B\u01cedoiu","year":"2002","unstructured":"B\u01cedoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: STOC\u201902: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, New York, NY, USA, 2002, pp.\u00a0250\u2013257. Assoc. Comput. Mach., New York (2002)"},{"key":"9107_CR8","volume-title":"Convex Optimization","author":"S. Boyd","year":"2003","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2003)"},{"key":"9107_CR9","unstructured":"Gao, J., Langberg, M., Schulman, L.: Clustering lines: classification of incomplete data. Manuscript (2006)"},{"key":"9107_CR10","unstructured":"Har-Peled, S.: Private communication"},{"key":"9107_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1145\/1007352.1007400","volume-title":"STOC\u201904: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing","author":"S. Har-Peled","year":"2004","unstructured":"Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. In: STOC\u201904: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, New York, NY, USA, 2004, pp.\u00a0291\u2013300. Assoc. Comput. Mach., New York (2004)"},{"key":"9107_CR12","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/513400.513440","volume-title":"SCG\u201902: Proceedings of the Eighteenth Annual Symposium on Computational Geometry","author":"S. Har-Peled","year":"2002","unstructured":"Har-Peled, S., Varadarajan, K.: Projective clustering in high dimensions using core-sets. In: SCG\u201902: Proceedings of the Eighteenth Annual Symposium on Computational Geometry, New York, NY, USA, 2002, pp.\u00a0312\u2013318. Assoc. Comput. Mach., New York (2002)"},{"key":"9107_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/S0097539703427963","volume":"33","author":"S. Har-Peled","year":"2003","unstructured":"Har-Peled, S., Wang, Y.: Shape fitting with outliers. SIAM J. Comput. 33, 269\u2013285 (2003)","journal-title":"SIAM J. Comput."},{"key":"9107_CR14","first-page":"175","volume":"32","author":"E. Helly","year":"1923","unstructured":"Helly, E.: \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten. Jahresber. Dtsch. Math.-Ver. 32, 175\u2013176 (1923)","journal-title":"Jahresber. Dtsch. Math.-Ver."},{"issue":"1","key":"9107_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10957-005-2653-6","volume":"126","author":"P. Kumar","year":"2005","unstructured":"Kumar, P., Yildirim, E.A.: Minimum volume enclosing ellipsoids and core sets. J.\u00a0Optim. Theory Appl. 126(1), 1\u201321 (2005)","journal-title":"J.\u00a0Optim. Theory Appl."},{"key":"9107_CR16","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, A.: Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions. In: Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, pp.\u00a045\u201355 (2003)"},{"key":"9107_CR17","first-page":"1.1","volume":"8","author":"P. Kumar","year":"2003","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. J.\u00a0Exp. Algorithmics 8, 1.1 (2003)","journal-title":"J.\u00a0Exp. Algorithmics"},{"key":"9107_CR18","volume-title":"Statistical Analysis with Missing Data","author":"R.J.A. Little","year":"1986","unstructured":"Little, R.J.A., Rubin, D.B.: Statistical Analysis with Missing Data. Wiley, New York (1986)"},{"issue":"4\/5","key":"9107_CR19","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J. Matousek","year":"1996","unstructured":"Matousek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\/5), 498\u2013516 (1996)","journal-title":"Algorithmica"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9107-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-008-9107-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-008-9107-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T01:45:15Z","timestamp":1684547115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-008-9107-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,23]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9107"],"URL":"https:\/\/doi.org\/10.1007\/s00454-008-9107-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,23]]}}}