Results 51 to 60 of about 42,360 (298)
Fixed-Parameter Algorithms for Unsplittable Flow Cover [PDF]
, 2020 International audienceThe Unsplittable Flow Cover problem (UFP-cover) models the well-studied general caching problem and various natural resource allocation settings.
, Mari, Mathieu, Wiese, Andreas
core +2 more sources
Colored Hypergraph Isomorphism is Fixed Parameter Tractable [PDF]
Algorithmica, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Arvind, V. +3 more
openaire +3 more sources
Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization
EURASIP Journal on Advances in Signal Processing, 2018 The complexity of agent localization increases significantly when unique identification of the agents is not possible. Corresponding application cases include multiple-source localization, in which the agents do not have identification sequences at all ...
Stephan Schlupkothen +2 more
doaj +1 more source
Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset [PDF]
, 2012 Given a directed graph $G$, a set of $k$ terminals and an integer $p$, the \textsc{Directed Vertex Multiway Cut} problem asks if there is a set $S$ of at most $p$ (nonterminal) vertices whose removal disconnects each terminal from all other terminals ...
Chitnis, Rajesh +2 more
core +2 more sources
Parameterized algorithms for block-structured integer programs with large entries [PDF]
TheoretiCSWe study two classic variants of block-structured integer programming. Two-stage stochastic programs are integer programs of the form $\{A_i \mathbf{x} + D_i \mathbf{y}_i = \mathbf{b}_i\textrm{ for all }i=1,\ldots,n\}$, where $A_i$ and $D_i$ are bounded ...
Jana Cslovjecsek +4 more
doaj +1 more source
Exploiting bounded signal flow for graph orientation based on cause-effect pairs
Algorithms for Molecular Biology, 2011 Background We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions.
Niedermeier Rolf +4 more
doaj +1 more source
Fixed-Parameter Tractability of Token Jumping on Planar Graphs
, 2015 Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets
AE Mouawad +12 more
core +1 more source
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters
, 2014 We study the parameterized complexity of the graph isomorphism problem when parameterized by width parameters related to tree decompositions. We apply the following technique to obtain fixed-parameter tractability for such parameters. We first compute an
A. Bouland +15 more
core +1 more source
Fixed-Parameter Tractable Distances to Sparse Graph Classes [PDF]
Algorithmica, 2016 We show that for various classes C$$\mathcal {C}$$ of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C$$\mathcal {C}$$ is fixed-parameter tractable. The results are based on two general techniques.
Bulian, Jannis, Dawar, Anuj
openaire +5 more sources
Algorithms, 2013 We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing ...
Rolf Niedermeier +2 more
doaj +1 more source