{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:17:05Z","timestamp":1772914625294,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998,1]]},"DOI":"10.1016\/s0020-0190(97)00212-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"95-99","source":"Crossref","is-referenced-by-count":27,"title":["Enclosing k points in the smallest axis parallel rectangle"],"prefix":"10.1016","volume":"65","author":[{"given":"Michael","family":"Segal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klara","family":"Kedem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00212-3_BIB1","article-title":"Combinatorial Search","author":"Aigner","year":"1988"},{"key":"10.1016\/S0020-0190(97)00212-3_BIB2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","article-title":"Finding k points with minimum diameter and related problems","volume":"12","author":"Aggarwal","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(97)00212-3_BIB3","first-page":"26","article-title":"On some geometric selection and optimization problems via sorted matrices","volume":"vol. 955","author":"Glozman","year":"1995"},{"key":"10.1016\/S0020-0190(97)00212-3_BIB4","first-page":"265","article-title":"Static and dynamic algorithms for k-point clustering problems","volume":"vol. 709","author":"Datta","year":"1993"},{"key":"10.1016\/S0020-0190(97)00212-3_BIB5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02574012","article-title":"Iterated nearest neighbors and finding minimal polytopes","volume":"11","author":"Eppstein","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(97)00212-3_BIB6","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/0213002","article-title":"Generalized selection and ranking: Sorted matrices","volume":"13","author":"Frederickson","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00212-3_BIB7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02570713","article-title":"On geometric optimization with few violated constraints","volume":"14","author":"Matou\u0161ek","year":"1995","journal-title":"Discrete Comput Geom."},{"key":"10.1016\/S0020-0190(97)00212-3_BIB8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0020-0190(89)90166-X","article-title":"L-infinity interdistance selection by parametric search","volume":"30","author":"Salowe","year":"1989","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002123?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002123?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:27:08Z","timestamp":1556044028000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0020019097002123"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00212-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}