{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:13:39Z","timestamp":1725578019823},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642190933"},{"type":"electronic","value":"9783642190940"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19094-0_17","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T01:21:40Z","timestamp":1297300900000},"page":"158-169","source":"Crossref","is-referenced-by-count":1,"title":["Clustering with Internal Connectedness"],"prefix":"10.1007","author":[{"given":"Neelima","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Aditya","family":"Pancholi","sequence":"additional","affiliation":[]},{"given":"Yogish","family":"Sabharwal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Arora, S., Raghavan, P., Rao, S.: Polynomial time approximation schemes for the Euclidian k-median problem. In: Symposium on Theory of Computing (1998)","key":"17_CR1","DOI":"10.1145\/276698.276718"},{"doi-asserted-by":"crossref","unstructured":"Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic clustering of the Web. In: World Wide Web Conference (WWW), pp. 391\u2013404 (1997)","key":"17_CR2","DOI":"10.1016\/S0169-7552(97)00031-7"},{"unstructured":"Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Hauchbaum, D.S. (ed.) Approximating algorithms for NP-Hard problem. PWS Publishing Company (1997)","key":"17_CR3"},{"doi-asserted-by":"crossref","unstructured":"Chen, K.: On k-median clustering in high dimensions. In: Symposium on Discrete Algorithms, pp. 1177\u20131185 (2006)","key":"17_CR4","DOI":"10.1145\/1109557.1109687"},{"key":"17_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"unstructured":"Dasgupta, S.: The hardness of k-means clustering, Technical Report CS2007-0890, University of California, San Diego (2007)","key":"17_CR6"},{"issue":"6","key":"17_CR7","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/(SICI)1097-4571(199009)41:6<391::AID-ASI1>3.0.CO;2-9","volume":"41","author":"S. Deerwester","year":"1990","unstructured":"Deerwester, S., Dumais, S.T., Landauer, T.K., Furnas, G.W., Harshman, R.A.: Indexing by latent semantic analysis. Journal of the Society for Information Science\u00a041(6), 391\u2013407 (1990)","journal-title":"Journal of the Society for Information Science"},{"key":"17_CR8","volume-title":"Pattern Classification","author":"R. Duda","year":"2001","unstructured":"Duda, R., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley Interscience, New York (2001)","edition":"2"},{"issue":"3","key":"17_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/BF00962238","volume":"3","author":"C. Faolutsos","year":"1994","unstructured":"Faolutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petkovic, D., Equitz, W.: Efficient and effective querying by image context. Journal of Intelligent Information Systems\u00a03(3), 231\u2013262 (1994)","journal-title":"Journal of Intelligent Information Systems"},{"doi-asserted-by":"crossref","unstructured":"Ge, R., Ester, M., Gao, S.J., Hu, Z., Bhattacharya, B.: Join Cluster Analysis of Attribute Data and Relationship Data: The connected k-Center Problem, Algorithm and Applications. TKDD\u00a02(2) (2008)","key":"17_CR10","DOI":"10.1145\/1376815.1376816"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1992","unstructured":"Goemans, M.X., Williamson, D.P.: A General Approximation Technique For Constrained Forest Problems. SIAM Journal on Computing\u00a024(2), 296\u2013317 (1992)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mazumdar, S.: Coresets for k-means and k-median clustering and their applications. In: Symposium on Theory of Computing, pp. 291\u2013300 (2004)","key":"17_CR12","DOI":"10.1145\/1007352.1007400"},{"doi-asserted-by":"crossref","unstructured":"Kumar, A., Sabharwal, Y., Sen, S.: Linear-Time approximation schemes for Clustering Problems in any Dimensions. Journal of the ACM\u00a057(2) (2010)","key":"17_CR13","DOI":"10.1145\/1667053.1667054"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","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 problems. SIAM Journal on Computing\u00a013(1), 182\u2013196 (1984)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Symposium on Theory of Computing, pp. 475\u2013484 (1997)","key":"17_CR15","DOI":"10.1145\/258533.258641"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00130487","volume":"7","author":"M.J. Swain","year":"1991","unstructured":"Swain, M.J., Ballard, D.H.: Color indexing. International Journal of Conputer Vision\u00a07, 11\u201332 (1991)","journal-title":"International Journal of Conputer Vision"},{"key":"17_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis","author":"K. Wasserman","year":"1994","unstructured":"Wasserman, K., Faust, K.: Social Network Analysis. Cambridge University Press, Cambridge (1994)"},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/S1441-3582(04)70094-4","volume":"12","author":"C. Webster","year":"2004","unstructured":"Webster, C., Morrison, P.: Network analysis in marketing. Australasian Market. J.\u00a012(2), 8\u201318 (2004)","journal-title":"Australasian Market. J."},{"issue":"8-10","key":"17_CR19","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1016\/j.tcs.2008.11.005","volume":"410","author":"Z. Zhang","year":"2009","unstructured":"Zhang, Z., Gao, X., Wu, W.: Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theoretical Computer Science\u00a0410(8-10), 812\u2013817 (2009)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19094-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T08:48:05Z","timestamp":1559983685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19094-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642190933","9783642190940"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19094-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}