Least cost influence propagation in (social) networks
From MaRDI portal
Publication:1650779
DOI10.1007/s10107-018-1288-yzbMath1391.90110OpenAlexW2800909495WikidataQ57705345 ScholiaQ57705345MaRDI QIDQ1650779
Michael Kahr, Matteo Fischetti, Mario Ruthmair, Michele Monaci, Markus Leitner
Publication date: 13 July 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/656433
Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (9)
Influence Maximization with Latency Requirements on Social Networks ⋮ Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ Weighted target set selection on trees and cycles ⋮ A branch‐and‐cut approach for the least cost influence problem on social networks ⋮ Efficient presolving methods for the influence maximization problem ⋮ Large-scale influence maximization via maximal covering location ⋮ An exact algorithm for robust influence maximization ⋮ Least-Cost Influence Maximization on Social Networks ⋮ A polyhedral approach to least cost influence maximization in social networks
Cites Work
- Unnamed Item
- Unnamed Item
- Identifying sets of key players in a social network
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- A two-stage stochastic programming approach for influence maximization in social networks
- On the Approximability of Influence in Social Networks
- On the acyclic subgraph polytope
- Collective dynamics of ‘small-world’ networks
- Automata, Languages and Programming
This page was built for publication: Least cost influence propagation in (social) networks
