{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:59:34Z","timestamp":1742943574444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_8","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T04:08:43Z","timestamp":1449634123000},"page":"101-109","source":"Crossref","is-referenced-by-count":1,"title":["The Discrete and Mixed Minimax 2-Center Problem"],"prefix":"10.1007","author":[{"given":"Yi","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigen","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,9]]},"reference":[{"issue":"5","key":"8_CR1","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1137\/0220060","volume":"20","author":"JM Ho","year":"1991","unstructured":"Ho, J.M., Lee, D.T., Chang, C.H., Wong, C.K.: Minimum diameter spanning trees and related problems. SIAM J. Comput. 20(5), 987\u2013997 (1991)","journal-title":"SIAM J. Comput."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/PL00009387","volume":"20","author":"PK Agarwal","year":"2000","unstructured":"Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. Discrete Comput. Geom. 20, 287\u2013305 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR3","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":"8_CR4","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. Theory Appl. 13, 189\u2013198 (1999)","journal-title":"Comput. Geom. Theory Appl."},{"key":"8_CR5","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 the linear programming in \n                      \n                        \n                      \n                      $$R^3$$\n                      \n                        \n                          \n                            R\n                            3\n                          \n                        \n                      \n                     and related problems. SIAM J. Comput. 12, 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.comgeo.2003.07.007","volume":"27","author":"J Gudmundsson","year":"2004","unstructured":"Gudmundsson, J., Haverkort, H., Park, S.M., Shin, C.S., Wolff, A.: Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27, 87\u2013106 (2004)","journal-title":"Comput. Geom."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Jaromczyk, J., Kowaluk, M.: An efficient algorithm for the Euclidean two-center problem. In: Proceedings 10th ACM Symposium on Computational Geometry, pp. 303\u2013311 (1994)","DOI":"10.1145\/177424.178038"},{"key":"8_CR8","unstructured":"Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of the 8th ACMCSIAM Symposium Discrete Algorithms, pp. 131\u2013138 (1997)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"12","author":"J Hershberger","year":"1991","unstructured":"Hershberger, J., Suri, S.: Finding tailored partitions. J. Algorithms 12, 431\u2013463 (1991)","journal-title":"J. Algorithms"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/S0097539702404389","volume":"32","author":"TM Chan","year":"2003","unstructured":"Chan, T.M.: Semi-online maintenance of geometric optima and measures. SIAM J. Comput. 32(3), 700\u2013716 (2003)","journal-title":"SIAM J. Comput."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Shamos, M., Michael, I., Hoey, D.: Closest-point problems. In: 16th Annual Symposium on IEEE Foundations of Computer Science, pp. 151\u2013162 (1975)","DOI":"10.1109\/SFCS.1975.8"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.: On the complexity of some common geometric location problems. SIAM J. Comput. 13, 1182\u20131196 (1984)","journal-title":"SIAM J. Comput."},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.jpdc.2007.08.005","volume":"68","author":"S Roy","year":"2008","unstructured":"Roy, S., Bardhan, D., Das, S.: Base station placement on boundary of a convex polygon. J. Parallel Distrib. Comput. 68, 265\u2013273 (2008)","journal-title":"J. Parallel Distrib. Comput."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.tcs.2013.02.004","volume":"507","author":"CK Poon","year":"2013","unstructured":"Poon, C.K., Zhu, B.: Streaming with minimum space: an algorithm for covering by two congruent balls. Theor. Comput. Sci. 507, 72\u201382 (2013)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T17:14:52Z","timestamp":1559322892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}