Xiaokui Xiao, Ke Yi, Yufei Tao. The hardness and approximation algorithms for l-diversity. In Ioana Manolescu, Stefano Spaccapietra, Jens Teubner, Masaru Kitsuregawa, Alain Léger, Felix Naumann, Anastasia Ailamaki, Fatma Özcan, editors, EDBT 2010, 13th International Conference on Extending Database Technology, Lausanne, Switzerland, March 22-26, 2010, Proceedings. Volume 426 of ACM International Conference Proceeding Series, pages 135-146, ACM, 2010. [doi]
@inproceedings{XiaoYT10,
title = {The hardness and approximation algorithms for l-diversity},
author = {Xiaokui Xiao and Ke Yi and Yufei Tao},
year = {2010},
doi = {10.1145/1739041.1739060},
url = {http://doi.acm.org/10.1145/1739041.1739060},
tags = {empirical, case study, principles},
researchr = {https://researchr.org/publication/XiaoYT10},
cites = {0},
citedby = {0},
pages = {135-146},
booktitle = {EDBT 2010, 13th International Conference on Extending Database Technology, Lausanne, Switzerland, March 22-26, 2010, Proceedings},
editor = {Ioana Manolescu and Stefano Spaccapietra and Jens Teubner and Masaru Kitsuregawa and Alain Léger and Felix Naumann and Anastasia Ailamaki and Fatma Özcan},
volume = {426},
series = {ACM International Conference Proceeding Series},
publisher = {ACM},
isbn = {978-1-60558-945-9},
}