Influence maximization with latency requirements on social networks
From MaRDI portal
(Redirected from Publication:5085986)
Recommendations
- Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
- Least-cost influence maximization on social networks
- Least cost influence propagation in (social) networks
- A polyhedral approach to least cost influence maximization in social networks
- Large-scale influence maximization via maximal covering location
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- A branch‐and‐cut approach for the least cost influence problem 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
- An exact algorithm for robust influence maximization
- Approximation hardness of dominating set problems in bounded degree graphs
- Clique relaxations in social network analysis: the maximum k-plex problem
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- Integer Programming
- Introduction to algorithms.
- Least cost influence propagation in (social) networks
- Least-cost influence maximization on social networks
- Maximizing social influence in nearly optimal time
- Mixed integer linear programming formulation techniques
- New dominating sets in social networks
- On positive influence dominating sets in social networks
- 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
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- The Steiner tree polytope and related polyhedra
- The perfectly matchable subgraph polytope of a bipartite graph
- Why is maximum clique often easy in practice?
Cited in
(7)- Minimizing the expected complete influence time of a social network
- The temporal aspects of the evidence-based influence maximization on social networks
- Maximizing positive influence of live-campaign promotion in live social e-commerce networks
- Adjustable robust positive influence dominating set with partial payment
- Cost-Effective Social Media Influencer Marketing
- On the shoulders of giants: incremental influence maximization in evolving social networks
- Latency-bounded target set selection in social networks
This page was built for publication: Influence maximization with latency requirements on social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085986)
