{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T19:10:02Z","timestamp":1749928202153,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530574"},{"type":"electronic","value":"9783319530581"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53058-1_9","type":"book-chapter","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T09:01:41Z","timestamp":1485162101000},"page":"129-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Euclidean k-Supplier Problem in \"Equation missing\""],"prefix":"10.1007","author":[{"given":"Manjanna","family":"Basappa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh K.","family":"Jallu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gautam K.","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,24]]},"reference":[{"key":"9_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":"9_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., Van Kreveld, M., Overmars, M.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (2008)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-319-21407-8_16","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"M Basappa","year":"2015","unstructured":"Basappa, M., Jallu, R.K., Das, G.K.: Constrained k-center problem on a convex polygon. In: Gervasi, O., et al. (eds.) ICCSA 2015. LNCS, vol. 9156, pp. 209\u2013222. Springer, Heidelberg (2015). doi:10.1007\/978-3-319-21407-8_16"},{"key":"9_CR4","unstructured":"Brass, P., Knauer, C., Na, H.S., Shin, C.S.: Computing k-centers on a line. CoRR abs\/0902.3282 (2009)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bose, P., Toussaint, G.: Computing the constrained Euclidean, geodesic and link center of a simple polygon with applications. In: Proceedings of Pacific Graphics International, pp. 102\u2013112 (1996)","DOI":"10.1109\/CGI.1996.511792"},{"issue":"2","key":"9_CR6","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":"9_CR7","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. Comb. Opt. 27(3), 504\u2013518 (2014)","journal-title":"J. Comb. Opt."},{"issue":"8","key":"9_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.dam.2011.01.008","volume":"159","author":"A Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., Jiang, M.: Constrained $$k$$-center and movement to independence. Discrete Appl. Math. 159(8), 859\u2013865 (2011)","journal-title":"Discrete Appl. Math."},{"key":"9_CR9","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)","DOI":"10.1145\/62212.62255"},{"key":"9_CR10","doi-asserted-by":"publisher","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."},{"key":"9_CR11","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D Hochbaum","year":"1995","unstructured":"Hochbaum, D.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston (1995)"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","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."},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"DS Hochbaum","year":"1986","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33(3), 533\u2013550 (1986)","journal-title":"J. ACM"},{"key":"9_CR14","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":"9_CR15","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 subexponential time. Algorithmica 9, 398\u2013423 (1993)","journal-title":"Algorithmica"},{"issue":"2","key":"9_CR16","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. Comb. Opt. 25(2), 176\u2013190 (2013)","journal-title":"J. Comb. Opt."},{"key":"9_CR17","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.-Z., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 299\u2013309. Springer, Heidelberg (2000). doi:10.1007\/3-540-44968-X_30"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). doi:10.1007\/978-3-642-36694-9_25"},{"key":"9_CR19","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."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53058-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T18:38:53Z","timestamp":1749926333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-53058-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530574","9783319530581"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53058-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 January 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conferences.au.dk\/algo16\/algosensors\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}