{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:11:48Z","timestamp":1725869508578},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_25","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T08:16:59Z","timestamp":1477815419000},"page":"340-349","source":"Crossref","is-referenced-by-count":2,"title":["The Mixed Center Location 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"}]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"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)","key":"25_CR1","DOI":"10.1145\/177424.178038"},{"unstructured":"Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 131\u2013138 (1997)","key":"25_CR2"},{"key":"25_CR3","doi-asserted-by":"crossref","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. Discret. Comput. Geom. 18, 125\u2013134 (1997)","journal-title":"Discret. Comput. Geom."},{"key":"25_CR4","doi-asserted-by":"crossref","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":"25_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(93)90153-Z","volume":"47","author":"J Hershberger","year":"1993","unstructured":"Hershberger, J.: A faster algorithm for the two-center decision problem. Inform. Process. Lett. 47, 23\u201329 (1993)","journal-title":"Inform. Process. Lett."},{"key":"25_CR6","doi-asserted-by":"crossref","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"},{"key":"25_CR7","doi-asserted-by":"crossref","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. Discret. Comput. Geom. 20, 287\u2013305 (2000)","journal-title":"Discret. Comput. Geom."},{"key":"25_CR8","doi-asserted-by":"crossref","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":"25_CR9","first-page":"741","volume":"35","author":"Z Drezener","year":"1984","unstructured":"Drezener, Z.: The p-center problem-heuristics and optimal algorithms. J. Oper. Res. Soc. 35, 741\u2013748 (1984)","journal-title":"J. Oper. Res. Soc."},{"key":"25_CR10","doi-asserted-by":"crossref","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 $$R^3$$ and related problems. SIAM J. Comput. 12, 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"RZ Hwang","year":"1993","unstructured":"Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to solve the Euclidean p-center problem. Algorithmica 9, 1\u201322 (1993)","journal-title":"Algorithmica"},{"issue":"2","key":"25_CR12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A best possible heuristic for the k-center problem. Math. Oper. Res. 10(2), 180\u2013184 (1985)","journal-title":"Math. Oper. Res."},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM Symposium on Theory of Computing, pp. 434\u2013444 (1988)","key":"25_CR14","DOI":"10.1145\/62212.62255"},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/978-3-642-36694-9_25","volume-title":"Integer Programming and Combinatorial Optimization","author":"V Nagarajan","year":"2013","unstructured":"Nagarajan, V., Schieber, B., Shachnai, H.: The Euclidean k-supplier problem. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 290\u2013301. Springer, Heidelberg (2013)"},{"key":"25_CR16","doi-asserted-by":"crossref","DOI":"10.1142\/8685","volume-title":"Voronoi Diagrams and Delaunay Triangulations","author":"F Aurenhammer","year":"2013","unstructured":"Aurenhammer, F., Klein, R., Lee, D.T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific Publishing Company, Singapore (2013)"}],"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-48749-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:24:37Z","timestamp":1498357477000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}