{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:11:34Z","timestamp":1649214694688},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0020-0190(02)00489-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"121-128","source":"Crossref","is-referenced-by-count":2,"title":["A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane"],"prefix":"10.1016","volume":"86","author":[{"given":"Nir","family":"Halman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00489-1_BIB001","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB002","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0020-0190(02)00489-1_BIB003","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1","article-title":"On the rectangular p-center problem","volume":"34","author":"Drezner","year":"1987","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB004","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/0215052","article-title":"On a multidimensional search technique and its application to the Euclidean one-center problem","volume":"15","author":"Dyer","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB005","series-title":"Facility Layout and Location\u2014An Analytical Approach","author":"Francis","year":"1974"},{"key":"10.1016\/S0020-0190(02)00489-1_BIB006","series-title":"Iterative Methods for Nonlinear Optimization Problems","author":"Jacoby","year":"1972"},{"key":"10.1016\/S0020-0190(02)00489-1_BIB007","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1137\/0123004","article-title":"The nucleolus as a solution of a minimization problem","volume":"23","author":"Kohlberg","year":"1972","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB008","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0020-0190(85)90015-8","article-title":"The power of geometric duality revisited","volume":"21","author":"Lee","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB009","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB010","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/moor.8.4.498","article-title":"The weighted Euclidean 1-center problem","volume":"8","author":"Megiddo","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB011","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00489-1_BIB012","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1016\/S0377-2217(96)00154-3","article-title":"On the lexicographic minimax approach to location problems","volume":"100","author":"Ogryczak","year":"1997","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0020-0190(02)00489-1_BIB013","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1145\/321724.321730","article-title":"On the optimality of some set algorithms","volume":"19","author":"Reingold","year":"1972","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00489-1_BIB014","series-title":"Proc. 12th ACM Symposium on Computational Geometry","first-page":"122","article-title":"Rectilinear and polygonal p-piercing and p-center problems","author":"Sharir","year":"1996"},{"key":"10.1016\/S0020-0190(02)00489-1_BIB015","unstructured":"A. Tamir, Private communication (2002)"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004891?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004891?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:29:32Z","timestamp":1553448572000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0020019002004891"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00489-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}