Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
From MaRDI portal
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
Cites work
- A branch‐and‐cut approach for the least cost influence problem on social networks
- A computational study of exact approaches for the bi-objective prize-collecting Steiner tree problem
- A two-stage stochastic programming approach for influence maximization in social networks
- An efficient linear programming based method for the influence maximization problem in social networks
- An extended formulation of the convex recoloring problem on a tree
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Clique relaxations in social network analysis: the maximum k-plex problem
- Exact approaches for network design problems with relays
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- Introduction to algorithms.
- Large-scale influence maximization via maximal covering location
- Least cost influence propagation in (social) networks
- Least-cost influence maximization on social networks
- New dominating sets in social networks
- On positive influence dominating sets in social networks
- On positive-influence target-domination
- On the 2-club polytope of graphs
- On the approximability of influence in social networks
- On the approximability of positive influence dominating set 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
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Stronger MIP formulations for the Steiner forest problem
- The dominating set polytope via facility location
- The perfectly matchable subgraph polytope of a bipartite graph
- Weighted target set selection on trees and cycles
- Why is maximum clique often easy in practice?
Cited in
(18)- A two-stage stochastic programming approach for influence maximization in social networks
- On the approximability of positive influence dominating set in social networks
- Maximizing positive influence in competitive social networks: a trust-based solution
- A polyhedral approach to least cost influence maximization in social networks
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Positive influence maximization in signed social networks under independent cascade model
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
- An \(L _{p }\) norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model
- Positive Influence Dominating Set in Online Social Networks
- Influence maximization with latency requirements on social networks
- An exact algorithm for robust influence maximization
- An exact algorithm for robust influence maximization
- An efficient local search algorithm for minimum positive influence dominating set problem
- Efficient presolving methods for the influence maximization problem
- On positive influence dominating sets in social networks
- Adjustable robust positive influence dominating set with partial payment
- Targeting the right person: an optimization-driven framework for optimal persuader selection in social networks with opinion evolution
- A denoising diffusion adaptive search for the -domination problem on social graphs
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)
