{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T16:31:00Z","timestamp":1686673860549},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,2,3]],"date-time":"2015-02-03T00:00:00Z","timestamp":1422921600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10878-015-9831-8","type":"journal-article","created":{"date-parts":[[2015,2,2]],"date-time":"2015-02-02T08:47:15Z","timestamp":1422866835000},"page":"1417-1429","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem"],"prefix":"10.1007","volume":"31","author":[{"given":"Dongyue","family":"Liang","sequence":"first","affiliation":[]},{"given":"Liquan","family":"Mei","sequence":"additional","affiliation":[]},{"given":"James","family":"Willson","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,3]]},"reference":[{"key":"9831_CR1","doi-asserted-by":"crossref","unstructured":"Archer A (2001) Two $$O(log^{*}k)$$ O ( l o g \u2217 k ) approximation algorithms for the asymmetric $$k$$ k -Center problem. Integer programming and cambinatorial optimization. Lecture Notes in Computer Science 2081:1\u201314","DOI":"10.1007\/3-540-45535-3_1"},{"key":"9831_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty SR (1976) Graph theory with applications. Elsevier Science Publishing Co., Inc., New York"},{"issue":"4","key":"9831_CR3","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/1082036.1082038","volume":"52","author":"J Chuzhoy","year":"2005","unstructured":"Chuzhoy J, Guha S, Halperin E, Khama S, Kortsarz G, Krauthgamer R, Naor J (2005) Asymmetric k-Center is $$\\log ^* n$$ log \u2217 n hard to approximate. J ACM 52(4):538\u2013551","journal-title":"J ACM"},{"key":"9831_CR4","doi-asserted-by":"crossref","unstructured":"Dyer ME, Frieze AM (1985) A simple heuristic for the $$p$$ p -center problem. Oper Res Lett 3(6):285\u2013288","DOI":"10.1016\/0167-6377(85)90002-1"},{"key":"9831_CR5","first-page":"7","volume":"2","author":"R Ge","year":"2008","unstructured":"Ge R, Ester M, Gao BJ, Hu Z, Bhattacharya B, Ben-Moshe B (2008) Joint cluster analysis of attribute data and delationship data: the connected $$k$$ k -Center problem, algorithms and applications. ACM Trans Knowl Discov Data 2:7","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"2","key":"9831_CR6","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$$ k -center problem. Math Oper Res 10(2):180\u2013184","journal-title":"Math Oper Res"},{"issue":"3","key":"9831_CR7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S Khuller","year":"2000","unstructured":"Khuller S, Sussmann YJ (2000) The capacitated $$K$$ K -Center problem. SIAM J Discrete Math 13(3):403\u2013418","journal-title":"SIAM J Discrete Math"},{"issue":"1\u20132","key":"9831_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S Khuller","year":"2000","unstructured":"Khuller S, Pless R, Sussmann YJ (2000) Fault tolerant $$K$$ K -center problems. Theor Comput Sci 242(1\u20132):237\u2013245","journal-title":"Theor Comput Sci"},{"key":"9831_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1006\/jagm.1997.0921","volume":"27","author":"R Panigrahy","year":"1998","unstructured":"Panigrahy R, Vishwanathan S (1998) An $$O(log^{*}n)$$ O ( l o g \u2217 n ) approximation algorithm for the asymmetric $$p$$ p -Center problem. J Algorithm 27:259\u2013268","journal-title":"J Algorithm"},{"key":"9831_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511921735","volume-title":"The design of approximation algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, Cambridge"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9831-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9831-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9831-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:25Z","timestamp":1559262205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9831-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,3]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["9831"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9831-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,3]]}}}