Results 11  20
of
152
Distortion is Fixed Parameter Tractable
"... We study lowdistortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective. Let M = M(G) be the shortest path metric of an edge weighted graph G, with the vertex set V (G) and the edge set E(G), on n v ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We study lowdistortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective. Let M = M(G) be the shortest path metric of an edge weighted graph G, with the vertex set V (G) and the edge set E(G), on n
Parameterized Complexity of Firefighting
"... The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be placed on an unburned vertex, permanently protecting it, and the fire spreads to all neighboring unprotec ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
unprotected vertices of burning vertices. The goal is to let as few vertices burn as possible. This problem is known to be NPcomplete, even when restricted to trees of maximum degree three. Initial study showed the Firefighter problem to be fixedparameter tractable on trees in various parameterizations
Parameterized Complexity of DAG Partitioning
, 2013
"... The goal of tracking the origin of short, distinctive phrases (memes) that propagate through the web in reaction to current events has been formalized as DAG Partitioning: given a directed acyclic graph, delete edges of minimum weight such that each resulting connected component of the underlying un ..."
Abstract
 Add to MetaCart
undirected graph contains only one sink. Motivated by NPhardness and hardness of approximation results, we consider the parameterized complexity of this problem. We show that it can be solved in O(2 k · n 2) time, where k is the number of edge deletions, proving fixedparameter tractability for parameter k
The Effect of Homogeneity on the Computational Complexity of Combinatorial Data Anonymization
 DATA MINING AND KNOWLEDGE DISCOVERY
, 2012
"... A matrix M is said to be kanonymous if for each row r in M there are at least k − 1 other rows in M which are identical to r. 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) ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
) at most s entries. Complementing previous work, we introduce two new “datadriven” parameterizations for kAnonymity—the number tin of different input rows and the number tout of different output rows— both modeling aspects of data homogeneity. We show that kAnonymity is fixedparameter tractable
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
, 2002
"... We consider the parameterized complexity of the following problem under the flamework introduced by Downey and Fellows[4]: Given a graph G, an integer parmneter : and a nontrivial hereditary property H, are there vertices of G that induce a subgraph with property H? This problem has been proved ..."
Abstract

Cited by 32 (6 self)
 Add to MetaCart
proved NPhard by Lewis and Yanna kakis[9]. e show that if H includes all independent sets but not all cliques or vice versa, then the problem is hard for the parameterized class kV[1] and is fixed parameter tractable otherwise. In the ibrmer case, if the tbrbidden set of the property is finite, we
Parameterized Complexity of Eulerian Deletion Problems
 ALGORITHMICA
"... We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge
Making a Hard Problem Easier: The Parameterized Complexity of the Unique Coverage Problem ⋆
"... Abstract. We consider the parameterized complexity of the Unique Coverage problem: given a family of sets and a parameter k, find a subfamily that covers at least k elements exactly once. This NPcomplete problem has applications in wireless networks and radio broadcasting and is also a natural gene ..."
Abstract
 Add to MetaCart
Abstract. We consider the parameterized complexity of the Unique Coverage problem: given a family of sets and a parameter k, find a subfamily that covers at least k elements exactly once. This NPcomplete problem has applications in wireless networks and radio broadcasting and is also a natural
On Tractable Cases of Target Set Selection
"... We study the NPcomplete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restriction to trees and bounded treewidth graphs, we classify the influence of the parameters “diameter”, “cluster edge delet ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
deletion number”, “vertex cover number”, and “feedback edge set number ” of the underlying graph on the problem’s complexity, revealing both tractable and intractable cases. For instance, even for diametertwo split graphs TSS remains very hard. TSS can be efficiently solved on graphs with small feedback
The parameterized complexity of the unique coverage problem
 In Proceedings of the 18th International Symposium on Algorithms and Computation (ISAAC), number 4835 in Lecture Notes in Computer Science
, 2007
"... We consider the parameterized complexity of the Unique Coverage problem: given a family of sets and a parameter k, we ask whether there exists a subfamily that covers at least k elements exactly once. This NPcomplete problem has applications in wireless networks and radio broadcasting and is also a ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We consider the parameterized complexity of the Unique Coverage problem: given a family of sets and a parameter k, we ask whether there exists a subfamily that covers at least k elements exactly once. This NPcomplete problem has applications in wireless networks and radio broadcasting and is also
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
, 2010
"... An important question in the study of constraint satisfaction problems (CSP) is understanding how the graph or hypergraph describing the incidence structure of the constraints influences the complexity of the problem. For binary CSP instances (i.e., where each constraint involves only two variables ..."
Abstract

Cited by 31 (4 self)
 Add to MetaCart
parameter tractable. In a matching hardness result, we show that if H has unbounded submodular width, then CSP(H) is not fixedparameter tractable (and hence not polynomialtime solvable), unless the Exponential Time Hypothesis (ETH) fails. The algorithmic result uses tree decompositions in a novel way: instead
Results 11  20
of
152