33 research outputs found
Parameterized Approximation Schemes using Graph Widths
Combining the techniques of approximation algorithms and parameterized
complexity has long been considered a promising research area, but relatively
few results are currently known. In this paper we study the parameterized
approximability of a number of problems which are known to be hard to solve
exactly when parameterized by treewidth or clique-width. Our main contribution
is to present a natural randomized rounding technique that extends well-known
ideas and can be used for both of these widths. Applying this very generic
technique we obtain approximation schemes for a number of problems, evading
both polynomial-time inapproximability and parameterized intractability bounds
Parameterized Inapproximability of Target Set Selection and Generalizations
In this paper, we consider the Target Set Selection problem: given a graph
and a threshold value for any vertex of the graph, find a minimum
size vertex-subset to "activate" s.t. all the vertices of the graph are
activated at the end of the propagation process. A vertex is activated
during the propagation process if at least of its neighbors are
activated. This problem models several practical issues like faults in
distributed networks or word-to-mouth recommendations in social networks. We
show that for any functions and this problem cannot be approximated
within a factor of in time, unless FPT = W[P],
even for restricted thresholds (namely constant and majority thresholds). We
also study the cardinality constraint maximization and minimization versions of
the problem for which we prove similar hardness results
Influence Diffusion in Social Networks under Time Window Constraints
We study a combinatorial model of the spread of influence in networks that
generalizes existing schemata recently proposed in the literature. In our
model, agents change behaviors/opinions on the basis of information collected
from their neighbors in a time interval of bounded size whereas agents are
assumed to have unbounded memory in previously studied scenarios. In our
mathematical framework, one is given a network , an integer value
for each node , and a time window size . The goal is to
determine a small set of nodes (target set) that influences the whole graph.
The spread of influence proceeds in rounds as follows: initially all nodes in
the target set are influenced; subsequently, in each round, any uninfluenced
node becomes influenced if the number of its neighbors that have been
influenced in the previous rounds is greater than or equal to .
We prove that the problem of finding a minimum cardinality target set that
influences the whole network is hard to approximate within a
polylogarithmic factor. On the positive side, we design exact polynomial time
algorithms for paths, rings, trees, and complete graphs.Comment: An extended abstract of a preliminary version of this paper appeared
in: Proceedings of 20th International Colloquium on Structural Information
and Communication Complexity (Sirocco 2013), Lectures Notes in Computer
Science vol. 8179, T. Moscibroda and A.A. Rescigno (Eds.), pp. 141-152, 201
Present state and future perspectives of using pluripotent stem cells in toxicology research
The use of novel drugs and chemicals requires reliable data on their potential toxic effects on humans. Current test systems are mainly based on animals or in vitro–cultured animal-derived cells and do not or not sufficiently mirror the situation in humans. Therefore, in vitro models based on human pluripotent stem cells (hPSCs) have become an attractive alternative. The article summarizes the characteristics of pluripotent stem cells, including embryonic carcinoma and embryonic germ cells, and discusses the potential of pluripotent stem cells for safety pharmacology and toxicology. Special attention is directed to the potential application of embryonic stem cells (ESCs) and induced pluripotent stem cells (iPSCs) for the assessment of developmental toxicology as well as cardio- and hepatotoxicology. With respect to embryotoxicology, recent achievements of the embryonic stem cell test (EST) are described and current limitations as well as prospects of embryotoxicity studies using pluripotent stem cells are discussed. Furthermore, recent efforts to establish hPSC-based cell models for testing cardio- and hepatotoxicity are presented. In this context, methods for differentiation and selection of cardiac and hepatic cells from hPSCs are summarized, requirements and implications with respect to the use of these cells in safety pharmacology and toxicology are presented, and future challenges and perspectives of using hPSCs are discussed
Parameterized Approximability of Maximizing the Spread of Influence in Networks
Abstract. In this paper, we consider the problem of maximizing the spread of influence through a social network. Here, we are given a graph G = (V, E), a positive integer k and a threshold value thr(v) attached to each vertex v ∈ V. The objective is then to find a subset of k vertices to “activate ” such that the number of activated vertices at the end of a propagation process is maximum. A vertex v gets activated if at least thr(v) of its neighbors are. We show that this problem is strongly inapproximable in fpt-time with respect to (w.r.t.) parameter k even for very restrictive thresholds. For unanimity thresholds, we prove that the problem is inapproximable in polynomial time and the decision version is W[1]-hard w.r.t. parameter k. On the positive side, it becomes r(n)approximable in fpt-time w.r.t. parameter k for any strictly increasing function r. Moreover, we give an fpt-time algorithm to solve the decision version for bounded degree graphs.
Latency-Bounded Target Set Selection in Social Networks
We study variants of the Target Set Selection problem, first proposed by Kempe et al. In our scenario one is given a graph G = (V,E), integer values t(v) for each vertex v, and the objective is to determine a small set of vertices (target set) that activates a given number (or a given subset) of vertices of G within a prescribed number of rounds. The activation process in G proceeds as follows: initially, at round 0, all vertices in the target set are activated; subsequently at each round r ≥ 1 every vertex of G becomes activated if at least t(v) of its neighbors are active by round r − 1. It is known that the problem of finding a minimum cardinality Target Set that eventually activates the whole graph G is hard to approximate to a factor better than O(2log1−ϵ∣∣V∣∣) . In this paper we give exact polynomial time algorithms to find minimum cardinality Target Sets in graphs of bounded clique-width, and exact linear time algorithms for trees
Latency-bounded target set selection in social networks
Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our scenario one is given a graph G=(V,E), integer values t(v) for each vertex v (thresholds ), and the objective is to determine a small set of vertices (target set ) that activates a given number (or a given subset) of vertices of G within a prescribed number of rounds. The activation process in G proceeds as follows: initially, at round 0, all vertices in the target set are activated; subsequently at each round r⩾1 every vertex of G becomes activated if at least t(v) of its neighbors are already active by round r−1. It is known that the problem of finding a minimum cardinality Target Set that eventually activates the whole graph G is hard to approximate to a factor better than O(2log1−ϵ|V|). In this paper we give exact polynomial time algorithms to find minimum cardinality Target Sets in graphs of bounded clique-width, and exact linear time algorithms for trees
On Tractable Cases of Target Set Selection
We study the NP-complete 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 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 diameter-two split graphs TSS remains very hard. TSS can be efficiently solved on graphs with small feedback edge set number and also turns out to be fixed-parameter tractable when parameterized by the vertex cover number, both results contrasting known parameterized intractability results for the parameter treewidth. While these tractability results are relevant for sparse networks, we also show efficient fixed-parameter algorithms for the parameter cluster edge deletion number, yielding tractability for certain dense networks