{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:33Z","timestamp":1759637673370},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"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,2]]},"DOI":"10.1016\/s0020-0190(02)00402-7","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T17:34:03Z","timestamp":1042824843000},"page":"205-210","source":"Crossref","is-referenced-by-count":7,"title":["A fast algorithm for the alpha-connected two-center decision problem"],"prefix":"10.1016","volume":"85","author":[{"given":"Po-Hsueh","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin Te","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(02)00402-7_BIB001","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01182774","article-title":"Planar geometric location problems","volume":"11","author":"Agarwal","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB002","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","article-title":"More planar two-center algorithms","volume":"13","author":"Chan","year":"1999","journal-title":"Comput. Geometry: Theory and Appl."},{"key":"10.1016\/S0020-0190(02)00402-7_BIB003","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/TC.1983.1676186","article-title":"Optimal algorithms for intersection and minimum distance problems between planar polygons","volume":"C-32","author":"Chin","year":"1983","journal-title":"IEEE Trans. Comput."},{"year":"1995","series-title":"Facility Location: A Survey of Applications and Methods","author":"Drezner","key":"10.1016\/S0020-0190(02)00402-7_BIB004"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB005","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/trsc.18.4.351","article-title":"The planer two-center and two-median problems","volume":"18","author":"Drezner","year":"1984","journal-title":"Transportation Sci."},{"key":"10.1016\/S0020-0190(02)00402-7_BIB006","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TIT.1983.1056714","article-title":"On the shape of a set of points in the plane","volume":"IT-29","author":"Edelsbrunner","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB007","series-title":"Algorithms in Combinatorial Geometry","volume":"10","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB008","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/ijoc.4.4.360","article-title":"Dynamic three-dimensional linear programming","volume":"4","author":"Eppstein","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0020-0190(02)00402-7_BIB009","series-title":"8th ACM-SIAM Symp. Discrete Algorithms","first-page":"131","article-title":"Faster construction of planar two-centers","author":"Eppstein","year":"1997"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB010","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01758770","article-title":"Randomized incremental construction of Delaunay and Voronoi diagrams","volume":"7","author":"Guibas","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB011","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(93)90153-Z","article-title":"A faster algorithm for the two-center decision problem","volume":"47","author":"Hershberger","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00402-7_BIB012","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","article-title":"Finding tailored partitions","volume":"12","author":"Hershberger","year":"1991","journal-title":"J. Algorithms"},{"year":"1992","series-title":"Some problems on radius-weighted model of packet radio network, Ph.D. Dissertation","author":"Huang","key":"10.1016\/S0020-0190(02)00402-7_BIB013"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB014","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(94)90007-8","article-title":"A sweepline algorithm to solve the two-center problem","volume":"49","author":"Huang","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(02)00402-7_BIB015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01185335","article-title":"The slab dividing approach to solve the Euclidean P-center problem","volume":"9","author":"Hwang","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB016","series-title":"10th ACM Symp. Computational Geometry","first-page":"303","article-title":"An efficient algorithm for the Euclidean two-center problem","author":"Jaromczyk","year":"1994"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB017","series-title":"9th ACM Symp. Computational Geometry","first-page":"198","article-title":"An expander-based approach to geometric optimization","author":"Katz","year":"1993"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB018","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Meggido","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB019","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)00402-7_BIB020","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1137\/0213014","article-title":"On the complexity of some common geometric location problems","volume":"13","author":"Megiddo","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(02)00402-7_BIB021","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. System Sci."},{"year":"1985","series-title":"Computational Geometry: An Introduction","author":"Preparata","key":"10.1016\/S0020-0190(02)00402-7_BIB022"},{"year":"1978","series-title":"Computational geometry, Ph.D. Dissertation","author":"Shamos","key":"10.1016\/S0020-0190(02)00402-7_BIB023"},{"key":"10.1016\/S0020-0190(02)00402-7_BIB024","series-title":"12th ACM Symp. Computational Geometry","first-page":"106","article-title":"A near-linear algorithm for the planar 2-center problem","author":"Sharir","year":"1996"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004027?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004027?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T17:20:51Z","timestamp":1553966451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0020019002004027"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00402-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}