{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,19]],"date-time":"2024-07-19T06:30:20Z","timestamp":1721370620465},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,12]],"date-time":"2009-11-12T00:00:00Z","timestamp":1257984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10878-009-9277-y","type":"journal-article","created":{"date-parts":[[2009,11,11]],"date-time":"2009-11-11T22:26:15Z","timestamp":1257978375000},"page":"97-119","source":"Crossref","is-referenced-by-count":13,"title":["Anonymizing binary and small tables is\u00a0hard\u00a0to\u00a0approximate"],"prefix":"10.1007","volume":"22","author":[{"given":"Paola","family":"Bonizzoni","sequence":"first","affiliation":[]},{"given":"Gianluca","family":"Della\u00a0Vedova","sequence":"additional","affiliation":[]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,12]]},"reference":[{"key":"9277_CR1","first-page":"153","volume-title":"PODS","author":"G Aggarwal","year":"2006","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Khuller S, Panigrahy R, Thomas D, Zhu A (2006) Achieving anonymity via clustering. In: Vansummeren S (ed) PODS. ACM, New York, pp 153\u2013162"},{"key":"9277_CR2","series-title":"Lecture notes in computer science","first-page":"246","volume-title":"ICDT","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Anonymizing tables. In: Eiter T, Libkin L (eds) ICDT. Lecture notes in computer science, vol 3363. Springer, Berlin, pp 246\u2013258"},{"key":"9277_CR3","unstructured":"Aggarwal G, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A (2005) Approximation algorithms for k-anonymity. J Priv Technol 2"},{"issue":"1\u20132","key":"9277_CR4","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P Alimonti","year":"2000","unstructured":"Alimonti P, Kann V (2000) Some APX-completeness results for cubic graphs. Theor Comput Sci 237(1\u20132):123\u2013134","journal-title":"Theor Comput Sci"},{"key":"9277_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Crescenzi P, Gambosi V, Kann G, Marchetti-Spaccamela A, Protasi M (1999) Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer, Berlin"},{"key":"9277_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/978-3-540-85097-7_3","volume-title":"COCOA","author":"R Chaytor","year":"2008","unstructured":"Chaytor R, Evans PA, Wareham T (2008) Fixed-parameter tractability of anonymizing data by suppressing entries. In: Yang B, Du D-Z, Wang CA (eds) COCOA. Lecture notes in computer science, vol 5165. Springer, Berlin, pp 23\u201331"},{"issue":"2","key":"9277_CR7","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S1570-8667(03)00079-0","volume":"2","author":"L Gasieniec","year":"2004","unstructured":"Gasieniec L, Jansson J, Lingas A (2004) Approximation algorithms for hamming clustering problems. J\u00a0Discrete Algorithms 2(2):289\u2013301","journal-title":"J\u00a0Discrete Algorithms"},{"key":"9277_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/978-3-540-75520-3_40","volume-title":"ESA","author":"A Gionis","year":"2007","unstructured":"Gionis A, Tassa T (2007) k-anonymization with minimal loss of information. In: Arge L, Hoffmann M, Welzl E (eds) ESA. Lecture notes in computer science, vol 4698. Springer, Berlin, pp 439\u2013450"},{"issue":"1","key":"9277_CR9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M Li","year":"2002","unstructured":"Li M, Ma B, Wang L (2002) Finding similar regions in many sequences. J Comput Syst Sci 65(1):73\u201396","journal-title":"J Comput Syst Sci"},{"key":"9277_CR10","first-page":"67","volume-title":"SIGMOD Conference","author":"H Park","year":"2007","unstructured":"Park H, Shim K (2007) Approximate algorithms for k-anonymity. In: Chan CY, Ooi BC, Zhou A (eds) SIGMOD Conference. ACM, New York, pp 67\u201378"},{"issue":"6","key":"9277_CR11","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1109\/69.971193","volume":"13","author":"P Samarati","year":"2001","unstructured":"Samarati P (2001) Protecting respondents\u2019 identities in microdata release. IEEE Trans Knowl Data Eng 13(6):1010\u20131027","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"9277_CR12","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1145\/275487.275508","volume-title":"PODS","author":"P Samarati","year":"1998","unstructured":"Samarati P, Sweeney L (1998) Generalizing data to provide anonymity when disclosing information. In: PODS. ACM, New York, p 188 (abstract)"},{"issue":"5","key":"9277_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney L (2002) k-anonymity: a model for protecting privacy. Int J Uncertain Fuzziness Knowl-Based Syst 10(5):557\u2013570","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9277-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-009-9277-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-009-9277-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:15Z","timestamp":1559276295000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-009-9277-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,12]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9277"],"URL":"https:\/\/doi.org\/10.1007\/s10878-009-9277-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,12]]}}}