Parameterized Approximability of Maximizing the Spread of Influence in Networks
From MaRDI portal
Publication:4925269
DOI10.1007/978-3-642-38768-5_48zbMath1382.68329arXiv1303.6907OpenAlexW2266517838MaRDI QIDQ4925269
Morgan Chopin, Florian Sikora, André Nichterlein, Cristina Bazgan
Publication date: 11 June 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1303.6907
Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (8)
Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ On the harmless set problem parameterized by treewidth ⋮ A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks ⋮ Latency-bounded target set selection in social networks ⋮ Constant thresholds can make target set selection tractable ⋮ The complexity of finding harmless individuals in social networks ⋮ Influence diffusion in social networks under time window constraints ⋮ Spread of influence in weighted networks under time and budget constraints
This page was built for publication: Parameterized Approximability of Maximizing the Spread of Influence in Networks
