{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T14:37:09Z","timestamp":1673447829627},"reference-count":38,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0304-3975(01)00258-4","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"501-514","source":"Crossref","is-referenced-by-count":4,"title":["On computing the diameter of a point set in high dimensional Euclidean space"],"prefix":"10.1016","volume":"287","author":[{"given":"Daniele V.","family":"Finocchiaro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00258-4_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1002\/net.3230130404","article-title":"A survey of heuristics for the weighted matching problem","volume":"13","author":"Avis","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB3","unstructured":"S.N. Bespamyatnikh, An efficient algorithm for the three-dimensional diameter problem, in: Proc. 9th Symp. on Discrete Algorithms, 1998, pp. 137\u2013146."},{"issue":"36","key":"10.1016\/S0304-3975(01)00258-4_BIB4","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik\u2013Chervonenkis dimension","volume":"4","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB5","doi-asserted-by":"crossref","unstructured":"A. Borodin, R. Ostrovsky, Y. Rabani, Subquadratic approximation algorithms for clustering problems in high dimensional spaces, in: Proc. 31st ACM Symp. on the Theory of Computing, 1999, pp. 435\u2013444.","DOI":"10.1145\/301250.301367"},{"issue":"8\u201313","key":"10.1016\/S0304-3975(01)00258-4_BIB6","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1016\/S0169-7552(97)00031-7","article-title":"Syntactic clustering of the Web","volume":"29","author":"Broder","year":"1997","journal-title":"Computer Networks and ISDN Systems"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02573973","article-title":"Diameter, width, closest line pair, and parametric searching","volume":"10","author":"Chazelle","year":"1993","journal-title":"Discrete and Comput. Geom."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry, II","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete and Comput. Geom."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB9","doi-asserted-by":"crossref","unstructured":"D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, in: Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB10","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1214\/aop\/1176995384","article-title":"Central limit theorems for empirical measures","volume":"6","author":"Dudley","year":"1978","journal-title":"Ann. Probab."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB11","first-page":"1","article-title":"A course on empirical processes","volume":"vol. 1097","author":"Dudley","year":"1984"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(89)90045-8","article-title":"Approximating the diameter of a set of points in the Euclidean space","volume":"32","author":"Eg\u0303eciog\u0303lu","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB13","doi-asserted-by":"crossref","first-page":"248","DOI":"10.2307\/2305092","article-title":"On sets of distances of n points","volume":"53","author":"Erd\u00f6s","year":"1946","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB14","first-page":"165","article-title":"On sets of distances of points in Euclidean spaces","volume":"5","author":"Erd\u00f6s","year":"1960","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"issue":"9","key":"10.1016\/S0304-3975(01)00258-4_BIB15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/2.410146","article-title":"Query by image and video content","volume":"28","author":"Flickner","year":"1995","journal-title":"Computer"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB16","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0095-8956(88)90043-3","article-title":"The Johnson\u2013Lindenstrauss lemma and the sphericity of some graphs","volume":"44","author":"Frankl","year":"1998","journal-title":"J. Combin. Theory Series B"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB17","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF02187841","article-title":"Inner and outer j-radii of convex bodies in finite dimensional normed spaces","volume":"7","author":"Gritzmann","year":"1992","journal-title":"Discrete and Comput. Geom."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01581243","article-title":"Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces","volume":"59","author":"Gritzmann","year":"1993","journal-title":"Math. Program"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB19","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00111-U","article-title":"On the complexity of some basic problems in computational convexity","volume":"136","author":"Gritzmann","year":"1994","journal-title":"Discrete Math."},{"issue":"9","key":"10.1016\/S0304-3975(01)00258-4_BIB20","first-page":"18","article-title":"Guest editors\u2019 introduction","volume":"28","author":"Gudivada. V.V. Raghavan","year":"1995","journal-title":"Computer"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB21","series-title":"Clustering Algorithms","author":"Hartigan","year":"1975"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB22","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"\u03b5-nets and simplex range queries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete and Comput. Geom."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB23","series-title":"SIGGRAPH 95 Conference Proc.","first-page":"277","article-title":"Fast multiresolution image querying","author":"Jacobs","year":"1995"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"Johnson","year":"1984","journal-title":"Contemporary Mathematics"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB25","doi-asserted-by":"crossref","unstructured":"J.M. Kleinberg, Two algorithms for nearest-neighbor search in high dimensions, in: Proc. 29th ACM Symp. on the Theory of Computing, 1997, pp. 599\u2013608.","DOI":"10.1145\/258533.258653"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB26","series-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB27","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek, O. Schwarzkopf, A deterministic algorithm for the three-dimensional diameter problem, in: Proc. 25th ACM Symp. on the Theory of Computing, 1993, pp. 478\u2013484.","DOI":"10.1145\/167088.167217"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB28","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB29","series-title":"Computational Geometry","author":"Mulmuley","year":"1994"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB30","series-title":"Handbook of Discrete and Computational Geometry","first-page":"797","article-title":"Pattern recognition","author":"O'Rourke","year":"1997"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB31","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB32","doi-asserted-by":"crossref","unstructured":"E.A. Ramos, Construction of 1-d lower envelopes and applications, in: Proc. of the 13th Symp. on Computational Geometry, 1997, pp. 57\u201366.","DOI":"10.1145\/262839.262864"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB33","first-page":"39","article-title":"Sur un probl\u00e8me g\u00e9ometrique de P. Erd\u00f6s","volume":"5","author":"Straszewicz","year":"1957","journal-title":"Bull. Acad. Polon. Sci. Cl. III"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB34","unstructured":"K.J. Supowit, New techniques for some dynamic closest-point and farthest-point problems, in: Proc. 1st ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 84\u201390."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB35","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."},{"key":"10.1016\/S0304-3975(01)00258-4_BIB36","series-title":"A Theory of Learning and Generalization","author":"Vidyasagar","year":"1997"},{"key":"10.1016\/S0304-3975(01)00258-4_BIB37","unstructured":"A.C. Yao. Personal Communication, Also in \u201cOn computing the distance matrix of n points in k dimensions\u201d, TR IBM San Jose Research Center, 1982."},{"issue":"4","key":"10.1016\/S0304-3975(01)00258-4_BIB38","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","article-title":"On constructing minimum spanning trees in k-dimensional spaces and related problems","volume":"11","author":"Yao","year":"1982","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002584?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002584?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T07:38:55Z","timestamp":1554795535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0304397501002584"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00258-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}