#### DMCA

## Parameterized Complexity of k-Anonymity: Hardness and Tractability (2010)

### Citations

1308 | K-anonymity: A model for protecting privacy
- Sweeney
(Show Context)
Citation Context ...de some information that can be exploited to identify the row pertaining to a certain individual. For instance, ZIP code, gender and date of birth can uniquely identify 87% of individuals in the U.S. =-=[18]-=-. Therefore when managing personal data it is of the utmost importance to effectively protect individuals’ privacy. One approach to deal with such problem is the k-anonymity model [16, 18, 15, 12]. Ea... |

1208 | Parameterized Complexity
- Downey, Fellows
- 1999
(Show Context)
Citation Context ...d cases are known [2]. Recently, two polynomial-time approximation algorithms with factor O(log k) have been independently proposed [14, 11]. In this paper we investigate the parameterized complexity =-=[8, 13]-=- of the problem, unveiling how different parameters are involved in the complexity of the problem. A first systematic study of the parameterized complexity of the k-anonymity problem has been proposed... |

511 | Protecting respondents’ identities in microdata release,”IEEE
- Samarati
- 2001
(Show Context)
Citation Context ...als in the U.S. [18]. Therefore when managing personal data it is of the utmost importance to effectively protect individuals’ privacy. One approach to deal with such problem is the k-anonymity model =-=[16, 18, 15, 12]-=-. Each row of a given table represents all data regarding a certain individual. Then different rows are clustered together, and some entries of the rows in each cluster are suppressed (i.e. they are r... |

444 | Invitation to Fixed-Parameter Algorithms.
- Niedermeier
- 2006
(Show Context)
Citation Context ...d cases are known [2]. Recently, two polynomial-time approximation algorithms with factor O(log k) have been independently proposed [14, 11]. In this paper we investigate the parameterized complexity =-=[8, 13]-=- of the problem, unveiling how different parameters are involved in the complexity of the problem. A first systematic study of the parameterized complexity of the k-anonymity problem has been proposed... |

309 | Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties - Ausiello, Crescenzi, et al. - 1999 |

275 |
On the Complexity of Optimal k-Anonymity,
- Meyerson, Williams
- 2004
(Show Context)
Citation Context ...als in the U.S. [18]. Therefore when managing personal data it is of the utmost importance to effectively protect individuals’ privacy. One approach to deal with such problem is the k-anonymity model =-=[16, 18, 15, 12]-=-. Each row of a given table represents all data regarding a certain individual. Then different rows are clustered together, and some entries of the rows in each cluster are suppressed (i.e. they are r... |

193 | Generalizing data to provide anonymity when disclosing information
- Samarati, Sweeney
(Show Context)
Citation Context ...als in the U.S. [18]. Therefore when managing personal data it is of the utmost importance to effectively protect individuals’ privacy. One approach to deal with such problem is the k-anonymity model =-=[16, 18, 15, 12]-=-. Each row of a given table represents all data regarding a certain individual. Then different rows are clustered together, and some entries of the rows in each cluster are suppressed (i.e. they are r... |

119 | Fixed-parameter tractability and completeness II: on completeness for W[1]. Theor
- Downey, Fellows
- 1995
(Show Context)
Citation Context ...e exists a clustering Π = (P1, . . . , Pt) of R such that |Pi| ≥ k for each set Pi, and c(Π) ≤ e. We present a parameter preserving reduction from the h-Clique problem, which is known to be W[1]-hard =-=[9]-=-, to the 〈e〉-AP problem. Given a graph G = (V,E), an h-clique is a set V ′ ⊆ V where each pair of vertices in V ′ are connected by an edge of G, and |V ′| = h. The h-Clique problem asks for a subset V... |

105 | Achieving Anonymity via Clustering. In
- Aggarwal, Feder, et al.
- 2006
(Show Context)
Citation Context ...t and as well as on a table consists of a bounded number of columns. In this paper we study how the complexity of the problem is influenced by different parameters. First we show that the problem is W=-=[1]-=--hard when parameterized by the value of the solution (and k). Then we exhibit a fixed-parameter algorithm when the problem is parameterized by the number of columns and the maximum number of differen... |

98 | Anonymizing tables, - Aggarwal, Feder, et al. - 2005 |

84 |
Some APX-completeness results for cubic graphs,
- Alimonti, Kann
- 2000
(Show Context)
Citation Context ... that is k-AP when each row consists of exactly 3 columns and k = 3. We show that 3-AP(3) is APXhard via an L-reduction from Minimum Vertex Cover on Cubic Graphs (MVCC), which is known to be APX-hard =-=[4]-=-. Due to page limit, we only sketch the proof. The MVCC problem, given a cubic graph G = (V,E), asks for a smallest C ⊆ V such that each edge of G has at least one of its endpoints in C. Let G = (V,E)... |

62 | Approximation algorithms for k-anonymity,”
- Aggarwal, Feder, et al.
- 2005
(Show Context)
Citation Context ...tice that different formulations of the problem have also been proposed [1], for example allowing the generalization of entry values, that is an entry value can be replaced with a less specific value =-=[3]-=-, or considering a notion of proximity among values [10]. A parsimonious principle leads to the optimization problem where we want to minimize the number of entries in the table to be suppressed. The ... |

52 |
Approximate algorithms for k-Anonymity,
- Park, Shim
- 2007
(Show Context)
Citation Context ...ry input alphabet, as well as approximation algorithms for restricted cases are known [2]. Recently, two polynomial-time approximation algorithms with factor O(log k) have been independently proposed =-=[14, 11]-=-. In this paper we investigate the parameterized complexity [8, 13] of the problem, unveiling how different parameters are involved in the complexity of the problem. A first systematic study of the pa... |

8 | k-anonymization with minimal loss of information
- Gionis, Tassa
- 2009
(Show Context)
Citation Context ...ry input alphabet, as well as approximation algorithms for restricted cases are known [2]. Recently, two polynomial-time approximation algorithms with factor O(log k) have been independently proposed =-=[14, 11]-=-. In this paper we investigate the parameterized complexity [8, 13] of the problem, unveiling how different parameters are involved in the complexity of the problem. A first systematic study of the pa... |

5 |
Fixed-parameter tractability of anonymizing data by suppressing entries
- Evans, Wareham, et al.
(Show Context)
Citation Context ...the problem, unveiling how different parameters are involved in the complexity of the problem. A first systematic study of the parameterized complexity of the k-anonymity problem has been proposed in =-=[7]-=-. Here, we follow the same direction, showing that the problem is W[1]-hard when parameterized by the size of the solution and k, and we provide a fixed-parameter algorithm, when the problem is parame... |

4 |
Fast algorithms for weighted bipartite matching
- Schwartz, Steger, et al.
- 2005
(Show Context)
Citation Context ...clustering of the rows in R that is a feasible solution for the 〈|Σ|,m〉-AP problem. See Fig. 4.2 for an example. Since GR,S′ bipartite, we can efficiently compute a maximum weight matching M of GR,S′ =-=[17]-=-. Given a matching M of the graph GR,S′ , Algorithm 2 computes in polynomial time a clustering ΠS′(M) of the rows in R. Informally, the clustering is computed by assigning the rows in R to the resolut... |

3 | The k-anonymity problem is hard
- Bonizzoni, Vedova, et al.
- 2009
(Show Context)
Citation Context ...roblem where we want to minimize the number of entries in the table to be suppressed. The k-anonymity problem is known to be APX-hard even when the matrix entries are over a binary alphabet and k = 3 =-=[6]-=-, as well as when the matrix has 8 columns and k = 4 (this time on arbitrary alphabets) [6]. Furthermore, a polynomial-time O(k)-approximation algorithm on arbitrary input alphabet, as well as approxi... |

2 | On the approximability of geometric and geographic generalization and the min-max bin covering problem
- Du, Eppstein, et al.
- 2009
(Show Context)
Citation Context ...so been proposed [1], for example allowing the generalization of entry values, that is an entry value can be replaced with a less specific value [3], or considering a notion of proximity among values =-=[10]-=-. A parsimonious principle leads to the optimization problem where we want to minimize the number of entries in the table to be suppressed. The k-anonymity problem is known to be APX-hard even when th... |