{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:01:48Z","timestamp":1761580908839},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_26","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"266-277","source":"Crossref","is-referenced-by-count":4,"title":["On the Complexity of the l-diversity Problem"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Dondi","sequence":"first","affiliation":[]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[]},{"given":"Italo","family":"Zoppis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-30570-5_17","volume-title":"Database Theory - ICDT 2005","author":"G. Aggarwal","year":"2005","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 (2005)"},{"issue":"2","key":"26_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/1150334.1150336","volume":"2","author":"N. Alon","year":"2006","unstructured":"Alon, N., Moshkovitz, D., Safra, S.: Algorithmic Construction of Sets for k-restrictions. ACM Trans. Algorithms\u00a02(2), 153\u2013177 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"1-2","key":"26_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-Completeness Results for Cubic Graphs. Theoretical Computer Science\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"Theoretical Computer Science"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-642-14162-1_33","volume-title":"Automata, Languages and Programming","author":"J. Blocki","year":"2010","unstructured":"Blocki, J., Williams, R.: Resolving the Complexity of Some Data Privacy Problems. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 393\u2013404. Springer, Heidelberg (2010)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-19222-7_25","volume-title":"Combinatorial Algorithms","author":"P. Bonizzoni","year":"2011","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R., Pirola, Y.: Parameterized Complexity of k-Anonymity: Hardness and Tractability. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2010. LNCS, vol.\u00a06460, pp. 242\u2013255. Springer, Heidelberg (2011)"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10878-009-9277-y","volume":"22","author":"P. Bonizzoni","year":"2011","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R.: Anonymizing Binary and Small Tables is Hard to Approximate. Journal of Comb. Opt.\u00a022(1), 97\u2013119 (2011)","journal-title":"Journal of Comb. Opt."},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-Parameter Tractability and Completeness ii: On Completeness for W[1]. Theoretical Computer Science\u00a0141, 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/s10878-009-9253-6","volume":"18","author":"P.A. Evans","year":"2009","unstructured":"Evans, P.A., Wareham, T., Chaytor, R.: Fixed-parameter Tractability of Anonymizing Data by Suppressing Entries. J. Comb. Optim.\u00a018(4), 362\u2013375 (2009)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1109\/TKDE.2008.129","volume":"21","author":"A. Gionis","year":"2009","unstructured":"Gionis, A., Tassa, T.: k-Anonymization with Minimal Loss of Information. IEEE Trans. Knowl. Data Eng.\u00a021(2), 206\u2013219 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Lenstra, H.: Integer Programming with a Fixed Number of Variables. Mathematics of Operations Research\u00a04(8) (1983)","DOI":"10.1287\/moor.8.4.538"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-14165-2_17","volume-title":"Automata, Languages and Programming","author":"J. Li","year":"2010","unstructured":"Li, J., Yi, K., Zhang, Q.: Clustering with diversity. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06198, pp. 188\u2013200. Springer, Heidelberg (2010)"},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/ICDE.2006.1","volume-title":"22nd International Conference on Data Engineering","author":"A. Machanavajjhala","year":"2006","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-Diversity: Privacy Beyond k-Anonymity. In: Liu, L., Reuter, A., Whang, K., Zhang, J. (eds.) 22nd International Conference on Data Engineering, p. 24. IEEE Computer Society, New York (2006)"},{"key":"26_CR13","first-page":"223","volume-title":"23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"A. Meyerson","year":"2004","unstructured":"Meyerson, A., Williams, R.: On the Complexity of Optimal K-Anonymity. In: Deutsch, A. (ed.) 23rd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 223\u2013228. ACM, New York (2004)"},{"key":"26_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"26_CR15","first-page":"67","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"H. Park","year":"2007","unstructured":"Park, H., Shim, K.: Approximate Algorithms for k-Anonymity. In: Chan, C.Y., Ooi, B.C., Zhou, A. (eds.) ACM SIGMOD International Conference on Management of Data, pp. 67\u201378. ACM Press, New York (2007)"},{"key":"26_CR16","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: Twenty-ninth Annual ACM Symposium on Theory of Computing (STOC 1997), pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"issue":"6","key":"26_CR17","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 Trans. Knowl. Data Eng.\u00a013(6), 1010\u20131027 (2001)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"26_CR18","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":"26_CR19","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1739041.1739060","volume-title":"13th International Conference on Extending Database Technology (EDBT 2010)","author":"X. Xiao","year":"2010","unstructured":"Xiao, X., Yi, K., Tao, Y.: The Hardness and Approximation Algorithms for l-diversity. In: Manolescu, I., Spaccapietra, S., Teubner, J., Kitsuregawa, M., Lger, A., Naumann, F., Ailamaki, A., Ozcan, F. (eds.) 13th International Conference on Extending Database Technology (EDBT 2010), pp. 135\u2013146. ACM Press, New York (2010)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:40:24Z","timestamp":1620042024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}