{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:51:28Z","timestamp":1743083488292,"version":"3.40.3"},"publisher-location":"India","reference-count":10,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132204862"},{"type":"electronic","value":"9788132204879"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-81-322-0487-9_39","type":"book-chapter","created":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T07:13:23Z","timestamp":1334387603000},"page":"405-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Spanning Tree Based k-Anonymity"],"prefix":"10.1007","author":[{"given":"K.","family":"Venkata Ramana","sequence":"first","affiliation":[]},{"given":"V.","family":"Valli Kumari","sequence":"additional","affiliation":[]},{"given":"K. V. S. V. N.","family":"Raju","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,15]]},"reference":[{"issue":"5","key":"39_CR1","first-page":"557","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: K-anonymity: a model for protecting privacy. International Journal on Uncertainty\u00a010(5), 557\u2013570 (2002)","journal-title":"International Journal on Uncertainty"},{"issue":"5","key":"39_CR2","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: Achieving k-anonymity privacy protection using generalization and Suppression. International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems\u00a010(5), 571\u2013588 (2002)","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"39_CR3","unstructured":"Gagan, A., Thomas, F., Krishnam, K., Zhu, A.: Achieving Anonymity via Clustering. In: Proc. of PODS 2006 (2006)"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Li, J., Wong, R.C.-W., Fu, A.W.-C., Pei, J.: Achieving k- Anonymity by clustering in Attribute Hierarchical Structures. In: 8th International Conference on Data Warehousing and Knowledge Discovery, Krakow, Poland, pp. 405\u2013416 (2006)","DOI":"10.1007\/11823728_39"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/978-3-540-72524-4_76","volume-title":"Advances in Data and Web Management","author":"H. Zhu","year":"2007","unstructured":"Zhu, H., Ye, X.: Achieving k-Anonymity Via a Density-Based Clustering Method. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds.) APWeb\/WAIM 2007. LNCS, vol.\u00a04505, pp. 745\u2013752. Springer, Heidelberg (2007)"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Kruskal, J.: On the shortest spanning sub tree and the travelling sales problem. In: Proceedings of the American Mathematical Society, pp. 48\u201350 (1956)","DOI":"10.1090\/S0002-9939-1956-0078686-7"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Nesetril, J., Milkova, E., Nesetrilova, H.: On minimum spanning tree problem. In: DMATH, p. 233 (2001)","DOI":"10.1016\/S0012-365X(00)00224-7"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Prim, R.: Shortest connection networks and some generalization. Bell Systems Technical Journal, 1389\u20131401 (1957)","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy preserving data mining. In: Proc. of the 2000 ACM SIGMOD International Conference on Management of Data, Dallas, Texas, pp. 439\u2013450 (2000)","DOI":"10.1145\/342009.335438"},{"key":"39_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-642-22726-4_59","volume-title":"Advances in Computing and Communications","author":"S.K. Adusumalli","year":"2011","unstructured":"Adusumalli, S.K., Kumari, V.V.: Attribute Based Anonymity for Preserving Privacy. In: Abraham, A., Mauri, J.L., Buford, J.F., Suzuki, J., Thampi, S.M. (eds.) ACC 2011, Part IV. Communications in Computer and Information Science, vol.\u00a0193, pp. 572\u2013579. Springer, Heidelberg (2011)"}],"container-title":["Advances in Intelligent and Soft Computing","Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011) December 20-22, 2011"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-0487-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:14:52Z","timestamp":1687392892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-0487-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9788132204862","9788132204879"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-0487-9_39","relation":{},"ISSN":["1867-5662","1867-5670"],"issn-type":[{"type":"print","value":"1867-5662"},{"type":"electronic","value":"1867-5670"}],"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"15 April 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}