Parameterized Inapproximability of Target Set Selection and Generalizations
dc.contributor.author | Bazgan, Cristina | |
dc.contributor.author | Chopin, Morgan | |
dc.contributor.author | Nichterlein, André | |
dc.contributor.author | Sikora, Florian
HAL ID: 742949 ORCID: 0000-0003-2670-6258 | |
dc.date.accessioned | 2016-10-26T13:13:37Z | |
dc.date.available | 2016-10-26T13:13:37Z | |
dc.date.issued | 2014 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/15892 | |
dc.language.iso | en | en |
dc.subject | Target Set Selection problem | |
dc.subject.ddc | 003 | en |
dc.subject.classificationjel | C.C4.C44 | en |
dc.title | Parameterized Inapproximability of Target Set Selection and Generalizations | |
dc.type | Communication / Conférence | |
dc.description.abstracten | In this paper, we consider the Target Set Selection problem: given a graph and a threshold value https://static-content.springer.com/image/chp%3A10.1007%2F978-3-319-08019-2_2/978-3-319-08019-2_2_IEq1_HTML.gif for each vertex v 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 v is activated during the propagation process if at least https://static-content.springer.com/image/chp%3A10.1007%2F978-3-319-08019-2_2/978-3-319-08019-2_2_IEq2_HTML.gif 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 f and ρ this problem cannot be approximated within a factor of ρ(k) in f(k) ·n O(1) 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. | |
dc.identifier.citationpages | 11-20 | |
dc.relation.ispartoftitle | Language, Life, Limits.10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings | |
dc.relation.ispartofeditor | Arnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer | |
dc.relation.ispartofpublname | Springer | |
dc.relation.ispartofpublcity | Berlin Heidelberg | |
dc.relation.ispartofdate | 2014 | |
dc.relation.ispartofurl | 10.1007/978-3-319-08019-2 | |
dc.identifier.urlsite | https://arxiv.org/abs/1403.3565v2 | |
dc.subject.ddclabel | Recherche opérationnelle | en |
dc.relation.ispartofisbn | 978-3-319-08018-5 | |
dc.relation.forthcoming | non | en |
dc.identifier.doi | 10.1007/978-3-319-08019-2_2 | |
dc.description.ssrncandidate | non | |
dc.description.halcandidate | oui | |
dc.description.readership | recherche | |
dc.description.audience | International | |
dc.date.updated | 2017-01-23T09:32:42Z | |
hal.identifier | hal-01388129 | * |
hal.version | 1 | * |
hal.update.action | updateFiles | * |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |