Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
From MaRDI portal
Publication:5087709
DOI10.1287/IJOC.2021.1144OpenAlexW4210930195MaRDI QIDQ5087709FDOQ5087709
Authors:
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
Recommendations
- On the approximability of positive influence dominating set in social networks
- On positive influence dominating sets in social networks
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
- Approximation algorithm for partial positive influence problem in social network
- Influence Maximization in Social Networks
- Efficient presolving methods for the influence maximization problem
- Influence maximization problem: properties and algorithms
- Better approximation algorithms for influence maximization in online social networks
- Parameterized approximability of maximizing the spread of influence in networks
social networksinteger programmingdominating setfacetsstrong formulationrapid influence maximization
Cites Work
- Introduction to algorithms.
- On the approximability of influence in social networks
- Title not available (Why is that?)
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- Title not available (Why is that?)
- New dominating sets in social networks
- The perfectly matchable subgraph polytope of a bipartite graph
- Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
- A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem
- On the approximability of positive influence dominating set in social networks
- Positive Influence Dominating Set in Online Social Networks
- On positive influence dominating sets in social networks
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- On positive-influence target-domination
- Exact approaches for network design problems with relays
- The dominating set polytope via facility location
- Least cost influence propagation in (social) networks
- Least-cost influence maximization on social networks
- On the 2-club polytope of graphs
- A two-stage stochastic programming approach for influence maximization in social networks
- A branch‐and‐cut approach for the least cost influence problem on social networks
- An extended formulation of the convex recoloring problem on a tree
- Large-scale influence maximization via maximal covering location
- An efficient linear programming based method for the influence maximization problem in social networks
- Why is maximum clique often easy in practice?
- Weighted target set selection on trees and cycles
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Stronger MIP formulations for the Steiner forest problem
Cited In (15)
- On the approximability of positive influence dominating set in social networks
- Efficient presolving methods for the influence maximization problem
- An efficient local search algorithm for minimum positive influence dominating set problem
- Positive Influence Dominating Set in Online Social Networks
- An \(L _{p }\) norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model
- Influence maximization with latency requirements on social networks
- A two-stage stochastic programming approach for influence maximization in social networks
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- A polyhedral approach to least cost influence maximization in social networks
- An exact algorithm for robust influence maximization
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
- Maximizing positive influence in competitive social networks: a trust-based solution
- An exact algorithm for robust influence maximization
- On positive influence dominating sets in social networks
- Positive influence maximization in signed social networks under independent cascade model
Uses Software
This page was built for publication: Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087709)
