{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:47:58Z","timestamp":1725511678409},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540788485"},{"type":"electronic","value":"9783540788492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78849-2_30","type":"book-chapter","created":{"date-parts":[[2008,4,28]],"date-time":"2008-04-28T13:49:01Z","timestamp":1209390541000},"page":"287-296","source":"Crossref","is-referenced-by-count":9,"title":["On the Complexity of Restricted k-anonymity Problem"],"prefix":"10.1007","author":[{"given":"Xiaoxun","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiuyong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-30570-5_17","volume-title":"Database Theory - ICDT 2005","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 246\u2013258. Springer, Heidelberg (2004)"},{"key":"30_CR2","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A.: Approximation algorithms for k-anonymity. Journal of Privacy Technology, (paper number 20051120001)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proc. of the 21st International Conference on Data Engineering (ICDE 2005), Tokyo, Japan, pp. 217\u2013228 (2005)","DOI":"10.1109\/ICDE.2005.42"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Fung, B., Wang, K., Yu, P.: Top-down specialization for information and privacy preservation. In: Proc. of the 21st International Conference on Data Engineering (ICDE 2005), Tokyo, Japan (2005)","DOI":"10.1109\/ICDE.2005.143"},{"key":"30_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of $\\cal{NP}$ -Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of $\\cal{NP}$ -Completeness. Freeman, San Francisco (1979)"},{"key":"30_CR6","volume-title":"Combinatorial Optimization: Networks and matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and matroids. Holt. Rinehart and Winston, New York (1976)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Incognito: Efficient fulldomain k-anonymity. In: Proc. of the 24th ACM SIGMOD International Conference on Management of Data, Baltimore, Maryland, USA, pp. 49\u201360 (2005)","DOI":"10.1145\/1066157.1066164"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: In Proc. of the 23rd ACM-SIGMOD-SIGACT-SIGART Symposium on the Principles of Database Systems, Paris, France, pp. 223\u2013228 (2004)","DOI":"10.1145\/1055558.1055591"},{"issue":"6","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondents\u2019 identities in microdata release. IEEE Transactions on Knowledge and Data Engineering\u00a013(6), 1010\u20131027 (2001)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing Data to Provide Anonymity when Disclosing Information (Abstract). In: Proc. of ACM Symposium on Principles of Database Systems, p. 188 (1998)","DOI":"10.1145\/275487.275508"},{"issue":"5","key":"30_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: a model for protecting privacy. International journal on uncertainty, Fuzziness and knowledge based systems\u00a010(5), 557\u2013570 (2002)","journal-title":"International journal on uncertainty, Fuzziness and knowledge based systems"},{"key":"30_CR12","unstructured":"Sun, X., Li, M., Wang, H., Plank, A.: An efficient hash-based algorithm for minimal k-anonymity problem. In: Thirty-First Australasian Computer Science Conference (ACSC2008), Wollongong, Australia (to appear 2008)"}],"container-title":["Lecture Notes in Computer Science","Progress in WWW Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78849-2_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:02:21Z","timestamp":1619521341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78849-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788485","9783540788492"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78849-2_30","relation":{},"subject":[]}}