Results 1  10
of
152
Parameterized Complexity of kAnonymity: Hardness and Tractability
, 2010
"... The problem of publishing personal data without giving up privacy is becoming increasingly important. A clean formalization that has been recently proposed is the kanonymity, where the rows of a table are partitioned in clusters of size at least k and all rows in a cluster become the same tuple, af ..."
Abstract
 Add to MetaCart
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 fixedparameter algorithm when the problem is parameterized by the number of columns and the maximum number of different
The effect of homogeneity on the complexity of kanonymity
 In Proc. 18th FCT, LNCS
"... Abstract. The NPhard kAnonymity problem asks, given an n × mmatrix M over a fixed alphabet and an integer s> 0, whether M can be made kanonymous by suppressing (blanking out) at most s entries. A matrix M is said to be kanonymous if for each row r in M there are at least k − 1 other rows in ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
parameter tractable for the parameter tin, and it is NPhard even for tout = 2 and alphabet size four. Notably, our fixedparameter tractability result implies that kAnonymity can be solved in linear time when tin is a constant. Our results also extend to some interesting generalizations of kAnonymity. 1
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal and Proper Interval Graphs
, 1994
"... We study the parameterized complexity of three NPhard graph completion problems. The MINIMUM FILLIN problem is to decide if a graph can be triangulated by adding at most k edges. We develop O(c m) and O(k mn + f(k)) algorithms for this problem on a graph with n vertices and m edges. Here f(k ..."
Abstract

Cited by 56 (5 self)
 Add to MetaCart
We study the parameterized complexity of three NPhard graph completion problems. The MINIMUM FILLIN problem is to decide if a graph can be triangulated by adding at most k edges. We develop O(c m) and O(k mn + f(k)) algorithms for this problem on a graph with n vertices and m edges. Here f(k
Parameterized Inapproximability of Degree Anonymization
"... The Degree Anonymity problem arises in the context of combinatorial graph anonymization. It asks, given a graph G and two integers k and s, whether G can be made kanonymous with at most s modifications. Here, a graph is kanonymous if the graph contains for every vertex at least k − 1 other verti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The Degree Anonymity problem arises in the context of combinatorial graph anonymization. It asks, given a graph G and two integers k and s, whether G can be made kanonymous with at most s modifications. Here, a graph is kanonymous if the graph contains for every vertex at least k − 1 other
The parameterized complexity of counting problems
 SIAM Journal on Computing
, 2002
"... We develop a parameterized complexity theory for counting problems. As the basis of this theory, we introduce a hierarchy of parameterized counting complexity classes #W[t], for t ≥ 1, that corresponds to Downey and Fellows’s Whierarchy [13] and show that a few central Wcompleteness results for de ..."
Abstract

Cited by 49 (0 self)
 Add to MetaCart
for decision problems translate to #Wcompleteness results for the corresponding counting problems. Counting complexity gets interesting with problems whose decision version is tractable, but whose counting version is hard. Our main result states that counting cycles and paths of length k in both directed
When is the evaluation of conjunctive queries tractable
 In Proceedings of the 33rd ACM Symposium on Theory of Computing
, 2001
"... zINRIARocquencourt Abstract The evaluation of conjunctive queries is hard both with respect to its combined complexity (NPcomplete) and its parameterized complexity (W[1]complete). It becomes tractable (PTIME for combined complexity, FPT for parameterized complexity), when the underlying graphs o ..."
Abstract

Cited by 42 (5 self)
 Add to MetaCart
zINRIARocquencourt Abstract The evaluation of conjunctive queries is hard both with respect to its combined complexity (NPcomplete) and its parameterized complexity (W[1]complete). It becomes tractable (PTIME for combined complexity, FPT for parameterized complexity), when the underlying graphs
On parameterized approximability
 Proc. of IWPEC, Lecture Notes in Computer Science 4169
, 2006
"... Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is to deal with the efficient approximation of small cost solutions for optimisation problems. Key words. Fixedparameter t ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is to deal with the efficient approximation of small cost solutions for optimisation problems. Key words. Fixed
Parameterized Complexity of Geometric Problems
, 2007
"... This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixedparameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixedparameter in ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
This paper surveys parameterized complexity results for hard geometric algorithmic problems. It includes fixedparameter tractable problems in graph drawing, geometric graphs, geometric covering and several other areas, together with an overview of the algorithmic techniques used. Fixed
Parameterized complexity of 1planarity
 Algorithms and Data Structures Symposium (WADS 2013
"... We consider the problem of finding a 1planar drawing for a general graph, where a 1planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NPhard we investigate the parameterized complexity of the problem with respect to the vertex c ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We consider the problem of finding a 1planar drawing for a general graph, where a 1planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NPhard we investigate the parameterized complexity of the problem with respect to the vertex
Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability
 DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1997
"... In this paper we give a programmatic overview of parameterized computational complexity in the broad context of the problem of coping with computational intractability. We give some examples of how fixedparameter tractability techniques can deliver practical algorithms in two different ways: (1) by ..."
Abstract

Cited by 87 (16 self)
 Add to MetaCart
surprising structural result concerning the top end of the parameterized complexity hierarchy: the naturally parameterized Graph kColoring problem cannot be resolved with respect to XP either by showing membership in XP, or by showing hardness for XP without settling the P = NP question one way or the other.
Results 1  10
of
152