Author:
Bonizzoni Paola,Della Vedova Gianluca,Dondi Riccardo
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Lecture Notes in Computer Science;G. Aggarwal,2004
2. Alimonti, P., Kann, V.: Some APX-Completeness Results for Cubic Graphs. Theoretical Computer Science 237(1-2), 123–134 (2000)
3. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)
4. Gionis, A., Tassa, T.: k-Anonymization with Minimal Loss of Information. IEEE Trans. Knowl. Data Eng. 21(2), 206–219 (2009)
5. 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–78. ACM Press, New York (2007)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Limiting Disclosure by Hiding the Identity;Introduction to Privacy Enhancing Technologies;2021
2. Improving privacy preservation policy in the modern information age;Health and Technology;2018-08-21
3. Anonymization and De-anonymization of Social Network Data;Encyclopedia of Social Network Analysis and Mining;2018
4. Anonymization and De-anonymization of Social Network Data;Encyclopedia of Social Network Analysis and Mining;2017-10-23
5. Privacy-Preserving Data Mining Techniques: Survey and Challenges;Studies in Applied Philosophy, Epistemology and Rational Ethics;2013