A polyhedral approach to least cost influence maximization in social networks

DOI10.1007/S10878-022-00971-XMaRDI QIDQ2111478zbMATH OpenOpenAlexFDO

Authors Cheng-Lung Chen, Eduardo L. Pasiliao, Vladimir Boginski

Publication date 16 January 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

social networksvalid inequalitiesinfluence maximizationdelayed cut generation

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Recommendations

• Least cost influence propagation in (social) networks
• Least-cost influence maximization on social networks
• Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
• Optimizing spread of influence in social networks via partial incentives
• Fast and frugal targeting with incentives

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• A branch‐and‐cut approach for the least cost influence problem on social networks
• A polyhedral study of dynamic monopolies
• A two-stage stochastic programming approach for influence maximization in social networks
• An exact algorithm for robust influence maximization
• Combinatorial model and bounds for target set selection
• Dynamic knapsack sets and capacitated lot-sizing
• Facets of the dynamic monopoly polytope: linear ordering formulation
• Integer programming approach to static monopolies in graphs
• Least cost influence propagation in (social) networks
• Least-cost influence maximization on social networks
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
• Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
• Lifted tableaux inequalities for 0-1 mixed-integer programs: a computational study
• New trends in influence maximization models
• On the acyclic subgraph polytope
• On the approximability of influence in social networks
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
• The 0-1 knapsack problem with a single continuous variable
• Weighted target set selection on trees and cycles

Cited in

(6)

• Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization
• Least cost influence propagation in (social) networks
• Least-cost influence maximization on social networks
• Influence maximization with latency requirements on social networks
• On unigraphic polyhedra with one vertex of degree \({p-2}\)
• A Polyhedral Approach to Least Cost Influence Maximization in Social Networks

Describes a project that uses

Uses Software

• Monopoly
• NetworkX

This page was built for publication: A polyhedral approach to least cost influence maximization in social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111478)