Parameterized Inapproximability of Target Set Selection and Generalizations

DOI10.1007/978-3-319-08019-2_2zbMath1432.68186arXiv1403.3565OpenAlexW2119215400MaRDI QIDQ5175873

Florian Sikora, André Nichterlein, Morgan Chopin, Cristina Bazgan

Publication date: 25 February 2015

Published in: Language, Life, Limits (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.3565

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Parameterized approximability of maximizing the spread of influence in networks

This page was built for publication: Parameterized Inapproximability of Target Set Selection and Generalizations