{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:10:53Z","timestamp":1742991053584,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030247652"},{"type":"electronic","value":"9783030247669"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24766-9_42","type":"book-chapter","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T23:09:48Z","timestamp":1564528188000},"page":"578-591","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points"],"prefix":"10.1007","author":[{"given":"Haitao","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jie","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BF01182774","volume":"11","author":"PK Agarwal","year":"1994","unstructured":"Agarwal, P.K., Sharir, M.: Planar geometric location problems. Algorithmica 11, 185\u2013195 (1994)","journal-title":"Algorithmica"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.comgeo.2014.08.004","volume":"48","author":"EM Arkin","year":"2015","unstructured":"Arkin, E.M., et al.: Bichromatic 2-center of pairs of points. Comput. Geom. 48, 94\u2013107 (2015)","journal-title":"Comput. Geom."},{"key":"42_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13, 189\u2013198 (1999)","journal-title":"Comput. Geom."},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B Chazelle","year":"1996","unstructured":"Chazelle, B., Matou\u0161ek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimension. J. Algorithms 21, 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"issue":"1","key":"42_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200\u2013208 (1987)","journal-title":"J. ACM"},{"key":"42_CR6","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/978-3-642-22006-7_65","volume-title":"Automata, Languages and Programming","author":"Hu Ding","year":"2011","unstructured":"Ding, H., Xu, J.: Solving the chromatic cone clustering problem via minimum spanning sphere. In: Proceedings of the 38th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 773\u2013784 (2011)"},{"issue":"3","key":"42_CR7","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E.: On a multidimensional search technique and its application to the Euclidean one centre problem. SIAM J. Comput. 15(3), 725\u2013738 (1986)","journal-title":"SIAM J. Comput."},{"key":"42_CR8","unstructured":"Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 131\u2013138 (1997)"},{"issue":"2","key":"42_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","volume":"24","author":"G Frederickson","year":"1982","unstructured":"Frederickson, G., Johnson, D.: The complexity of selection and ranking in $$X+Y$$ and matrices with sorted columns. J. Comput. Syst. Sci. 24(2), 197\u2013208 (1982)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G Frederickson","year":"1984","unstructured":"Frederickson, G., Johnson, D.: Generalized selection and ranking: sorted matrices. SIAM J. Comput. 13(1), 14\u201330 (1984)","journal-title":"SIAM J. Comput."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(93)90153-Z","volume":"1","author":"J Hershberger","year":"1993","unstructured":"Hershberger, J.: A faster algorithm for the two-center decision problem. Inf. Process. Lett. 1, 23\u201329 (1993)","journal-title":"Inf. Process. Lett."},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"3","author":"J Hershberger","year":"1991","unstructured":"Hershberger, J., Suri, S.: Finding tailored partitions. J. Algorithms 3, 431\u2013463 (1991)","journal-title":"J. Algorithms"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Jaromczyk, J., Kowaluk, M.: An efficient algorithm for the Euclidean two-center problem. In: Proceedings of the 10th Annual Symposium on Computational Geometry (SoCG), pp. 303\u2013311 (1994)","DOI":"10.1145\/177424.178038"},{"issue":"4","key":"42_CR14","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"issue":"4","key":"42_CR15","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $$R^3$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/PL00009311","volume":"18","author":"M Sharir","year":"1997","unstructured":"Sharir, M.: A near-linear algorithm for the planar 2-center problem. Discrete Comput. Geom. 18, 125\u2013134 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Wang, H., Xue, J.: Improved algorithms for the bichromatic two-center problem for pairs of points. arXiv:1905.00157 (2019)","DOI":"10.1007\/978-3-030-24766-9_42"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24766-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:56:15Z","timestamp":1710266175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-24766-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030247652","9783030247669"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24766-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Edmonton, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.wads.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}