Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
From MaRDI portal
Publication:5087709
DOI10.1287/ijoc.2021.1144OpenAlexW4210930195MaRDI QIDQ5087709
No author found.
Publication date: 1 July 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1144
integer programmingsocial networksdominating setfacetsstrong formulationrapid influence maximization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On positive-influence target-domination
- New dominating sets in social networks
- On positive influence dominating sets in social networks
- Least cost influence propagation in (social) networks
- An extended formulation of the convex recoloring problem on a tree
- A two-stage stochastic programming approach for influence maximization in social networks
- On the approximability of positive influence dominating set in social networks
- Large-scale influence maximization via maximal covering location
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- An efficient linear programming based method for the influence maximization problem in social networks
- Stronger MIP formulations for the Steiner forest problem
- A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
- Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
- On the 2-Club Polytope of Graphs
- Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
- The perfectly matchable subgraph polytope of a bipartite graph
- The Dominating Set Polytope via Facility Location
- Least-Cost Influence Maximization on Social Networks
- On the Approximability of Influence in Social Networks
- Positive Influence Dominating Set in Online Social Networks
- Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
- Exact Approaches for Network Design Problems with Relays
- Why Is Maximum Clique Often Easy in Practice?
- Weighted target set selection on trees and cycles
- A branch‐and‐cut approach for the least cost influence problem on social networks
This page was built for publication: Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
