The l-Diversity problem: Tractability and approximability

Publishing personal data without giving up privacy is becoming an increasingly important problem in different fields. In the last years, different interesting approaches have been proposed, i.e. k-Anonymity and l-Diversity. Given an input table, these approaches partition its rows so that the comput...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 511; pp. 159 - 171
Main Authors:	Dondi, Riccardo, Mauri, Giancarlo, Zoppis, Italo
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.11.2013
Subjects:	[formula omitted]-Anonymity [formula omitted]-Diversity Approximation complexity Parameterized complexity Approximation complexity l-Diversity k-Anonymity Parameterized complexity
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!