Show simple item record

dc.contributor.authorBazgan, Cristina
dc.contributor.authorChopin, Morgan
dc.contributor.authorNichterlein, André
dc.contributor.authorSikora, Florian
HAL ID: 742949
ORCID: 0000-0003-2670-6258
dc.date.accessioned2016-10-26T13:13:37Z
dc.date.available2016-10-26T13:13:37Z
dc.date.issued2014
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/15892
dc.language.isoenen
dc.subjectTarget Set Selection problem
dc.subject.ddc003en
dc.subject.classificationjelC.C4.C44en
dc.titleParameterized Inapproximability of Target Set Selection and Generalizations
dc.typeCommunication / Conférence
dc.description.abstractenIn 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.citationpages11-20
dc.relation.ispartoftitleLanguage, Life, Limits.10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014. Proceedings
dc.relation.ispartofeditorArnold Beckmann, Erzsébet Csuhaj-Varjú, Klaus Meer
dc.relation.ispartofpublnameSpringer
dc.relation.ispartofpublcityBerlin Heidelberg
dc.relation.ispartofdate2014
dc.relation.ispartofurl10.1007/978-3-319-08019-2
dc.identifier.urlsitehttps://arxiv.org/abs/1403.3565v2
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.ispartofisbn978-3-319-08018-5
dc.relation.forthcomingnonen
dc.identifier.doi10.1007/978-3-319-08019-2_2
dc.description.ssrncandidatenon
dc.description.halcandidateoui
dc.description.readershiprecherche
dc.description.audienceInternational
dc.date.updated2017-01-23T09:32:42Z
hal.identifierhal-01388129*
hal.version1*
hal.update.actionupdateFiles*


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record