{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T04:02:26Z","timestamp":1777608146107,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T00:00:00Z","timestamp":1509062400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10878-017-0195-0","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T22:16:43Z","timestamp":1509056203000},"page":"538-554","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The connected disk covering problem"],"prefix":"10.1007","volume":"35","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":"Wencheng","family":"Wang","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":[[2017,10,27]]},"reference":[{"key":"195_CR1","unstructured":"Brass P, Knauer C, Na HS, Shin CS (2009) Computing k-centers on a line. arXiv preprint \n                        arXiv: 0902.3282"},{"key":"195_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discrete Math 86:165\u2013177","journal-title":"Discrete Math"},{"issue":"11","key":"195_CR3","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1016\/j.jpdc.2006.05.004","volume":"66","author":"GK Das","year":"2006","unstructured":"Das GK, Das S, Nandy SC, Sinha BP (2006) Efficient algorithm for placing a given number of base stations to cover a convex region. J Parallel Distrib Comput 66(11):1353\u20131358","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"195_CR4","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1142\/S0129054108005747","volume":"19","author":"GK Das","year":"2008","unstructured":"Das GK, Roy S, Das S, Nandy SC (2008) Variations of base station placement problem on the boundary of a convex region. Int J Found Comput Sci 19(2):405\u2013427","journal-title":"Int J Found Comput Sci"},{"key":"195_CR5","first-page":"741","volume":"35","author":"Z Drezener","year":"1984","unstructured":"Drezener Z (1984) The P-center problem. Heuristics and optimal algorithms. J Oper Res Soc 35:741\u2013748","journal-title":"J Oper Res Soc"},{"issue":"3","key":"195_CR6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/s10878-012-9532-5","volume":"27","author":"H Du","year":"2014","unstructured":"Du H, Xu YF (2014) An approximation algorithm for k-center problem on a convex polygon. J Comb Optim 27(3):504\u2013518","journal-title":"J Comb Optim"},{"key":"195_CR7","doi-asserted-by":"crossref","unstructured":"Feder T, Greene D (1988) Optimal algorithms for approximate clustering. In: Proceedings of the 20th ACM symposium on theory of computing, pp 434\u2013444","DOI":"10.1145\/62212.62255"},{"key":"195_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez TF (1985) Clustering to minimize the maximum intercluster distance. Theor Comput Sci 38:293\u2013306","journal-title":"Theor Comput Sci"},{"issue":"2","key":"195_CR9","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Shmoys DB (1985) A best possible heuristic for the k-center problem. Math Oper Res 10(2):180\u2013184","journal-title":"Math Oper Res"},{"key":"195_CR10","doi-asserted-by":"crossref","unstructured":"Huang JH, Wang HL, Chao KM (2016) Computing the line-constrained k-center in the plane for small k. In: Algorithmic aspects in information and management. Springer International Publishing, pp 197\u2013208","DOI":"10.1007\/978-3-319-41168-2_17"},{"key":"195_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"RZ Hwang","year":"1993","unstructured":"Hwang RZ, Lee RCT, Chang RC (1993) The slab dividing approach to solve the euclidean P-center problem. Algorithmica 9:1\u201322","journal-title":"Algorithmica"},{"issue":"2","key":"195_CR12","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 SC, Bhattacharya BK (2013) Some variations on constrained minimum enclosing circle problem. J Comb Optim 25(2):176\u2013190","journal-title":"J Comb Optim"},{"key":"195_CR13","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo N (1983) Linear-time algorithms for the linear programming in \n                        $$R^3$$\n                        \n                            \n                                \n                                    R\n                                    3\n                                \n                            \n                        \n                     and related problems. SIAM J Comput 12:759\u2013776","journal-title":"SIAM J Comput"},{"key":"195_CR14","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1137\/0213014","volume":"13","author":"N Megiddo","year":"1984","unstructured":"Megiddo N, Supowit K (1984) On the complexity of some common geometric location problems. SIAM J Comput 13:1182\u20131196","journal-title":"SIAM J Comput"},{"key":"195_CR15","unstructured":"Nurmela KJ, Ostergard PRJ (2000) Covering a square with up to 30 equal circles. Research Report HUT-TCS-A62, Laboratory for Theoretical Computer Science, Helsinky University of Technology"},{"key":"195_CR16","doi-asserted-by":"crossref","first-page":"5330","DOI":"10.1016\/j.asoc.2011.05.026","volume":"11","author":"M Rezaei","year":"2011","unstructured":"Rezaei M, FazelZarandi MH (2011) Facility location via fuzzy modeling and simulation. Appl Soft Comput 11:5330\u20135340","journal-title":"Appl Soft Comput"},{"key":"195_CR17","doi-asserted-by":"crossref","unstructured":"Salhieh A, Weinmann J, Kochha M, Schwiebert L (2001) Power efficient topologies for wireless sensor networks. In: ICPP\u20192001, pp 156\u2013163","DOI":"10.1109\/ICPP.2001.952059"},{"key":"195_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2005.08.037","volume":"352","author":"WL Wu","year":"2006","unstructured":"Wu WL, Du HW, Jia XH, Li YS, Huang SCH (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theor Comput Sci 352:1\u20137","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0195-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0195-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0195-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,9]],"date-time":"2018-02-09T12:42:36Z","timestamp":1518180156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0195-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,27]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["195"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0195-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,27]]}}}