{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:57:13Z","timestamp":1649159833381},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"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":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00433-4","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T12:35:20Z","timestamp":1045053320000},"page":"75-87","source":"Crossref","is-referenced-by-count":7,"title":["Polynomial time algorithms for three-label point labeling"],"prefix":"10.1016","volume":"296","author":[{"given":"Rob","family":"Duncan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianbo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00433-4_BIB1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","article-title":"Label placement by maximum independent set in rectangles","volume":"11","author":"Agarwal","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB2","unstructured":"D. Beus, D. Crockett, Automated production of 1:24,000 scale quadrangle maps, in: Proc. 1994 ASPRS\/ACSM Annual Convention and Exposition, vol. 1, 1994, pp. 94\u201399."},{"issue":"4","key":"10.1016\/S0304-3975(02)00433-4_BIB3","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\/S0304-3975(02)00433-4_BIB4","unstructured":"J. Christensen, J. Marks, S. Shieber, Algorithms for cartographic label placement, in: Proc. 1993 ASPRS\/ACSM Annual Convention and Exposition, vol. 1, 1993, pp. 75\u201389."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/212332.212334","article-title":"An empirical study of algorithms for point-feature label placement","volume":"14","author":"Christensen","year":"1995","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB6","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB7","first-page":"65","article-title":"Static and dynamic algorithms for k-point clustering problems","volume":"vol. 709","author":"Datta","year":"1993"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB8","unstructured":"S. Doddi, M. Marathe, A. Mirzaian, B. Moret, B. Zhu, Map labeling and its generalizations, in: Proc. 8th ACM\u2013SIAM Symp. on Discrete Algorithms (SODA\u201997), New Orleans, LA, January 1997, pp. 148\u2013157."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB9","doi-asserted-by":"crossref","unstructured":"S. Doddi, M. Marathe, B. Moret, Point set labeling with specified positions, in: Proc. 16th Annu. ACM Symp. on Computational Geometry, June 2000, pp. 182\u2013190.","DOI":"10.1145\/336154.336200"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/129617.129620","article-title":"A rule-based system for cartographic name placement","volume":"35","author":"Doerschler","year":"1992","journal-title":"CACM"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB11","doi-asserted-by":"crossref","unstructured":"M. Formann, F. Wagner, A packing problem with applications to lettering of maps, in: Proc. 7th Annu. ACM Symp. on Computational Geometry, 1991, pp. 281\u2013288.","DOI":"10.1145\/109648.109680"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB12","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1559\/152304075784313304","article-title":"Positioning names on maps","volume":"2","author":"Imhof","year":"1975","journal-title":"Amer. Cartographer"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB14","doi-asserted-by":"crossref","unstructured":"C. Iturriaga, A. Lubiw, Elastic labels: the two-axis case, in: Proc. Graph Drawing\u201997, 1997, pp. 181\u2013192.","DOI":"10.1007\/3-540-63938-1_61"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB15","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/38.35536","article-title":"Cartographic name placement with Prolog","volume":"5","author":"Jones","year":"1989","journal-title":"Proc. IEEE Comput. Graphics Appl."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB16","doi-asserted-by":"crossref","unstructured":"K. Kakoulis, I. Tollis, An algorithm for labeling edges of hierarchical drawings, in: Proc. Graph Drawing\u201997, 1997, pp. 169\u2013180.","DOI":"10.1007\/3-540-63938-1_60"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB17","doi-asserted-by":"crossref","unstructured":"K. Kakoulis, I. Tollis, A unified approach to labeling graphical features, in: Proc. 14th Annu. ACM Symp. on Computational Geometry, 1998, pp. 347\u2013356.","DOI":"10.1145\/276884.276923"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB18","unstructured":"K. Kakoulis, I. Tollis, On the multiple label placement problem, in: Proc. 10th Canadian Conf. on Computational Geometry 1998, pp. 66\u201367."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB19","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1137\/0405033","article-title":"The problem of compatible representatives","volume":"5","author":"Knuth","year":"1992","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0925-7721(99)00005-X","article-title":"Point set labeling with sliding labels","volume":"13","author":"van Kreveld","year":"1999","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"10.1016\/S0304-3975(02)00433-4_BIB21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0020-0190(98)00002-7","article-title":"A polynomial time solution for labeling a rectilinear map","volume":"65","author":"Poon","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB22","series-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB23","first-page":"368","volume":"vol. 1879","author":"Qin","year":"2000"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB24","unstructured":"M. Spriggs, On the complexity of labeling maps with square pairs, manuscript, 2000."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0020-0190(01)00184-3","article-title":"A new bound for map labeling with uniform circle pairs","volume":"81","author":"Spriggs","year":"2002","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0304-3975(02)00433-4_BIB26","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."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(94)90001-9","article-title":"Approximate map labeling is in \u03a9(nlogn)","volume":"52","author":"Wagner","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00433-4_BIB28","doi-asserted-by":"crossref","unstructured":"F. Wagner, A. Wolff, Map labeling heuristics: provably good and practically useful, in: Proc. 11th Annu. ACM Symp. Computational Geometry 1995, pp. 109\u2013118.","DOI":"10.1145\/220279.220291"},{"key":"10.1016\/S0304-3975(02)00433-4_BIB29","first-page":"422","article-title":"A better lower bound for two-circle point labeling","volume":"vol. 1969","author":"Wolff","year":"2000"},{"issue":"4","key":"10.1016\/S0304-3975(02)00433-4_BIB30","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1142\/S0218195901000584","article-title":"Efficient approximation algorithms for two-label point labeling","volume":"11","author":"Zhu","year":"2001","journal-title":"Internat. J. Computat. Geom. Appl."},{"issue":"1","key":"10.1016\/S0304-3975(02)00433-4_BIB31","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1013326409918","article-title":"New approximation algorithms for map labeling with sliding labels","volume":"6","author":"Zhu","year":"2002","journal-title":"J. Combin. Optim."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004334?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004334?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T05:53:25Z","timestamp":1553925205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502004334"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00433-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}