Parameterized complexity of k-anonymity: hardness and tractability
Year of publication: |
2013
|
---|---|
Authors: | Bonizzoni, Paola ; Vedova, Gianluca Della ; Dondi, Riccardo ; Pirola, Yuri |
Published in: |
Journal of combinatorial optimization. - Norwell, Mass. : Springer Science + Business Media, ISSN 1382-6905, ZDB-ID 1339574-9. - Vol. 26.2013, 1, p. 19-43
|
Subject: | anonymity | fixed-parameter complexity | approximation algorithms | hardness | Algorithmus | Algorithm | Theorie | Theory | Komplexe Systeme | Complex systems | Komplexitätsmanagement | Complexity management |
-
Computational complexity of convoy movement planning problems
Gopalan, Ram, (2015)
-
Context specific complexity management : a recommendation model for optimal corporate complexity
Schott, Peter, (2015)
-
On the query complexity of Black-Peg AB-mastermind
Ouali, Mourad el, (2018)
- More ...
-
Anonymizing binary and small tables is hard to approximate
Bonizzoni, Paola, (2011)
-
Multiple Sequence Alignment as a Facility-Location Problem
Just, Winfried, (2004)
-
Looking for the Best and Brightest? Deservingness Regimes in Italian Labour Migration Management
Bonizzoni, Paola, (2018)
- More ...