{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:22Z","timestamp":1725860782931},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319411675"},{"type":"electronic","value":"9783319411682"}],"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-41168-2_17","type":"book-chapter","created":{"date-parts":[[2016,7,4]],"date-time":"2016-07-04T01:26:28Z","timestamp":1467595588000},"page":"197-208","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Line-Constrained k-center in the Plane for Small k"],"prefix":"10.1007","author":[{"given":"Albert Jhih-Heng","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hung-Lung","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/PL00009387","volume":"20","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M., Welzl, E.: The discrete 2-center problem. Discrete Comput. Geom. 20(3), 287\u2013305 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/11682462_19","volume-title":"LATIN 2006: Theoretical Informatics","author":"B Ben-Moshe","year":"2006","unstructured":"Ben-Moshe, B., Bhattacharya, B.K., Shi, Q.: An optimal algorithm for the continuous\/discrete weighted 2-center problem in trees. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 166\u2013177. Springer, Heidelberg (2006)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/978-3-540-73951-7_46","volume-title":"Algorithms and Data Structures","author":"B Bhattacharya","year":"2007","unstructured":"Bhattacharya, B., Shi, Q.: Optimal algorithms for the weighted p-center problems on the real line for small p. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 529\u2013540. Springer, Heidelberg (2007)"},{"issue":"2","key":"17_CR4","first-page":"157","volume":"21","author":"P Brass","year":"2011","unstructured":"Brass, P., Knauer, C., Na, H.-S., Shin, C.-S., Vigneron, A.: The aligned $$k$$ k -center problem. IJCGA 21(2), 157\u2013178 (2011)","journal-title":"IJCGA"},{"key":"17_CR5","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. 13, 189\u2013198 (1999)","journal-title":"Comput. Geom."},{"issue":"3","key":"17_CR6","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.comgeo.2004.12.002","volume":"31","author":"M Hoffmann","year":"2005","unstructured":"Hoffmann, M.: A simple linear algorithm for computing rectilinear 3-centers. Comput. Geom. 31(3), 150\u2013165 (2005)","journal-title":"Comput. Geom."},{"issue":"2","key":"17_CR7","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/s10878-012-9452-4","volume":"25","author":"A Karmakar","year":"2013","unstructured":"Karmakar, A., Das, S., Nandy, S.C., Bhattacharya, B.: Some variations on constrained minimum enclosing circle problem. J. Comb. Optim. 25(2), 176\u2013190 (2013)","journal-title":"J. Comb. Optim."},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-44968-X_30","volume-title":"Computing and Combinatorics","author":"SK Kim","year":"2000","unstructured":"Kim, S.K., Shin, C.-S.: Efficient algorithms for two-center problems for a convex polygon. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 299\u2013309. Springer, Heidelberg (2000)"},{"issue":"4","key":"17_CR9","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 linear programming in $$r^3$$ r 3 and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"17_CR10","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N., Supowit, K.J.: On the complexity of some common geometric location problem. SIAM J. Comput. 13(1), 182\u2013196 (1984)","journal-title":"SIAM J. Comput."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-08608-8","volume-title":"Algorithms and Computation","author":"H Wang","year":"2014","unstructured":"Wang, H., Zhang, J.: Line-constrained k-median, k-means, and k-center problems in the plane. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 3\u201314. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41168-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:43:58Z","timestamp":1498326238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41168-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319411675","9783319411682"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41168-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}