{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:05:47Z","timestamp":1763467547041},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"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":3760,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0925-7721(02)00102-5","type":"journal-article","created":{"date-parts":[[2002,12,2]],"date-time":"2002-12-02T16:20:15Z","timestamp":1038846015000},"page":"135-146","source":"Crossref","is-referenced-by-count":58,"title":["Fast approximations for sums of distances, clustering and the Fermat\u2013Weber problem"],"prefix":"10.1016","volume":"24","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(02)00102-5_BIB001","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02187906","article-title":"The algebraic degree of geometric optimization problems","volume":"3","author":"Bajaj","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(02)00102-5_BIB002","series-title":"Proceedings of the 6th International Workshop on Algorithms and Data Structures (WADS'99)","first-page":"318","article-title":"Optimal facility location under various distance functions","author":"Bespamyatnikh","year":"1999"},{"issue":"3","key":"10.1016\/S0925-7721(02)00102-5_BIB003","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0966-8349(95)00015-1","article-title":"The rectilinear distance minsum problem with minimum distance constraints","volume":"3","author":"Brimberg","year":"1995","journal-title":"Location Sci."},{"issue":"2","key":"10.1016\/S0925-7721(02)00102-5_BIB004","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01585739","article-title":"Algebraic optimization: The Fermat\u2013Weber location problem","volume":"46","author":"Chandrasekaran","year":"1990","journal-title":"Math. Programming"},{"issue":"2","key":"10.1016\/S0925-7721(02)00102-5_BIB005","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1287\/trsc.12.2.107","article-title":"Locating an obnoxious facility on a network","volume":"12","author":"Church","year":"1978","journal-title":"Transportation Sci."},{"key":"10.1016\/S0925-7721(02)00102-5_BIB006","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1287\/ijoc.4.4.418","article-title":"Efficient algorithms for the capacitated 1-median problem","volume":"4","author":"Elgindy","year":"1982","journal-title":"ORSA J. Comput."},{"issue":"2","key":"10.1016\/S0925-7721(02)00102-5_BIB007","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s00453-001-0010-1","article-title":"Robust distance-based clustering with applications to spatial data mining","volume":"30","author":"Estivill-Castro","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB008","series-title":"Facility Layout and Location: An Analytical Approach","author":"Francis","year":"1974"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB009","series-title":"Proceedings of the 31st ACM Symposium on Theory of Computing (STOC'99)","first-page":"428","article-title":"Sublinear time algorithms for metric space problems","author":"Indyk","year":"1999"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB010","series-title":"Abstracts for the Eleventh Canadian Conference on Computational Geometry (CCCG'99)","first-page":"65","article-title":"Improved algorithms for placing undesirable facilities","author":"Katz","year":"1999"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB011","series-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"Kaufman","year":"1990"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB012","doi-asserted-by":"crossref","first-page":"403","DOI":"10.2307\/2325085","article-title":"Two notes on notation","volume":"99","author":"Knuth","year":"1992","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB013","series-title":"Companion to Concrete Mathematics; Mathematical Techniques and Various Applications","author":"Melzak","year":"1973"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB014","series-title":"Proceedings of the 20th Conference on Very Large Databases (VLDB)","first-page":"144","article-title":"Efficient and effective clustering methods for spatial data mining","author":"Ng","year":"1994"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB015","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB016","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB017","series-title":"Proceedings of the Third Canadian Conference on Computational Geometry (CCCG'91)","first-page":"207","article-title":"Approximating the d-dimensional complete Euclidean graph","author":"Ruppert","year":"1991"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB018","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/S0925-7721(02)00102-5_BIB019","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1287\/mnsc.18.8.B478","article-title":"A note on the centre of gravity in depot location","volume":"18B","author":"Watson-Gandy","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/S0925-7721(02)00102-5_BIB020","series-title":"Statistical Methods in Land and Resource Survey","author":"Webster","year":"1990"},{"issue":"4","key":"10.1016\/S0925-7721(02)00102-5_BIB021","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":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001025?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772102001025?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T18:25:07Z","timestamp":1554229507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772102001025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0925772102001025"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(02)00102-5","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}