{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:05:56Z","timestamp":1763467556842},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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,7]]},"DOI":"10.1016\/s0020-0190(03)00256-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"101-105","source":"Crossref","is-referenced-by-count":8,"title":["A simple factor-3 approximation for labeling points with circles"],"prefix":"10.1016","volume":"87","author":[{"given":"Minghui","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianbo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongping","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Cimikowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00256-4_BIB001","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1006\/jagm.1995.1048","article-title":"Static and dynamic algorithms for k-point clustering problems","volume":"19","author":"Datta","year":"1995","journal-title":"J. Algorithms"},{"issue":"1\u20132","key":"10.1016\/S0020-0190(03)00256-4_BIB002","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1142\/S0218195902000736","article-title":"Point set labeling with specified positions","volume":"12","author":"Doddi","year":"2002","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0020-0190(03)00256-4_BIB003","series-title":"Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA'97), New Orleans, LA","first-page":"148","article-title":"Map labeling and its generalizations","author":"Doddi","year":"1997"},{"key":"10.1016\/S0020-0190(03)00256-4_BIB004","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(03)00256-4_BIB005","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"issue":"2","key":"10.1016\/S0020-0190(03)00256-4_BIB006","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1142\/S0218195901000444","article-title":"Labeling points with circles","volume":"11","author":"Strijk","year":"2001","journal-title":"Internat. J. Comput. Geom. Appl."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:51:30Z","timestamp":1553165490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0020019003002564"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00256-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}