{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:09Z","timestamp":1759638309864,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214061"},{"type":"electronic","value":"9783319214078"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21407-8_16","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:46Z","timestamp":1434700006000},"page":"209-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constrained k-Center Problem on a Convex Polygon"],"prefix":"10.1007","author":[{"given":"Manjanna","family":"Basappa","sequence":"first","affiliation":[]},{"given":"Ramesh K.","family":"Jallu","sequence":"additional","affiliation":[]},{"given":"Gautam K.","family":"Das","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s00453-001-0110-y","volume":"33","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.: Exact and approximation algorithms for clustering. Algorithmica 33, 201\u2013226 (2002)","journal-title":"Algorithmica"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/299917.299918","volume":"30","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithm for geometric optimization. ACM Comp. Surv. 30, 412\u2013458 (1998)","journal-title":"ACM Comp. Surv."},{"key":"16_CR3","unstructured":"Brass, P., Knauer, C., Na, H.S., Shin, C.S.: Computing k-centers on a line. CoRR abs\/ 0902.3282 (2009)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bose, P., Toussaint, G.: Computing the constrained euclidean, geodesic and link center of a simple polygon with applications. In: Proc. of Pacific Graphics International, pp. 102\u2013112 (1996)","DOI":"10.1109\/CGI.1996.511792"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1142\/S0129054108005747","volume":"19","author":"GK Das","year":"2008","unstructured":"Das, G.K., Roy, S., Das, S., Nandy, S.C.: Variations of base station placement problem on the boundary of a convex region. Int. J. Found. Comput. Sci. 19(2), 405\u2013427 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10878-012-9532-5","volume":"27","author":"H Du","year":"2014","unstructured":"Du, H., Xu, Y.: An approximation algorithm for k-center problem on a convex polygon. J. of Comb. Opt. 27(3), 504\u2013518 (2014)","journal-title":"J. of Comb. Opt."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jagm.2001.1194","volume":"42","author":"D Halperin","year":"2002","unstructured":"Halperin, D., Sharir, M., Goldberg, K.: The 2-center problem with obstacles. J. Algorithms 42, 109\u2013134 (2002)","journal-title":"J. Algorithms"},{"key":"16_CR8","first-page":"17","volume":"15","author":"F Hurtado","year":"2000","unstructured":"Hurtado, F., Sacriscan, V., Toussaint, G.: Facility location problems with constraints. Stud. Locat. Anal. 15, 17\u201335 (2000)","journal-title":"Stud. Locat. Anal."},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/BF01228511","volume":"9","author":"R Hwang","year":"1993","unstructured":"Hwang, R., Lee, R., Chang, R.: The generalized searching over separators strategy to solve some NP-hard problems in sub-exponential time. Algorithmica 9, 398\u2013423 (1993)","journal-title":"Algorithmica"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","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.K.: Some variations on constrained minimum enclosing circle problem. J. of Comb. Opt. 25(2), 176\u2013190 (2013)","journal-title":"J. of Comb. Opt."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"16_CR12","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":"16_CR13","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0966-8349(96)00012-5","volume":"4","author":"A Suzuki","year":"1996","unstructured":"Suzuki, A., Drezner, Z.: The $$p$$-center location problem in area. Location Sci. 4, 69\u201382 (1996)","journal-title":"Location Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications -- ICCSA 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21407-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T19:03:39Z","timestamp":1748459019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21407-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214061","9783319214078"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21407-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}