Weighted target set selection on trees and cycles

DOI10.1002/net.21972zbMath1530.91492OpenAlexW3089075478MaRDI QIDQ6087138

No author found.

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21972

zbMATH Keywords

integer programmingcyclespolytopesocial networkstreesinfluence maximization

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Linear programming (90C05)

Related Items (2)

Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem ⋮ A polyhedral approach to least cost influence maximization in social networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial model and bounds for target set selection
• Treewidth governs the complexity of target set selection
• On positive influence dominating sets in social networks
• Revisiting dynamic programming for finding optimal subtrees in trees
• The Steiner tree polytope and related polyhedra
• Least cost influence propagation in (social) networks
• A two-stage stochastic programming approach for influence maximization in social networks
• Some results on the target set selection problem
• The perfectly matchable subgraph polytope of a bipartite graph
• Integer Programming
• Least-Cost Influence Maximization on Social Networks
• Optimizing Spread of Influence in Social Networks via Partial Incentives
• On the Integrality of Some Facility Location Polytopes
• On the Approximability of Influence in Social Networks
• Formulating a Mixed Integer Programming Problem to Improve Solvability
• An exact algorithm for robust influence maximization

This page was built for publication: Weighted target set selection on trees and cycles