Influence maximization with latency requirements on social networks
From MaRDI portal
Publication:5085986
DOI10.1287/IJOC.2021.1095OpenAlexW3211542941MaRDI QIDQ5085986FDOQ5085986
Authors:
Publication date: 30 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1095
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
- Introduction to algorithms.
- Title not available (Why is that?)
- On the approximability of influence in social networks
- Clique relaxations in social network analysis: the maximum \(k\)-plex problem
- The Steiner tree polytope and related polyhedra
- Title not available (Why is that?)
- New dominating sets in social networks
- Approximation hardness of dominating set problems in bounded degree graphs
- The perfectly matchable subgraph polytope of a bipartite graph
- On the approximability of positive influence dominating set in social networks
- Positive Influence Dominating Set in Online Social Networks
- Integer Programming
- On positive influence dominating sets in social networks
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Mixed integer linear programming formulation techniques
- Maximizing social influence in nearly optimal time
- Least cost influence propagation in (social) networks
- Least-cost influence maximization on social networks
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- 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
- Why is maximum clique often easy in practice?
- An exact algorithm for robust influence maximization
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
Cited In (5)
- Minimizing the expected complete influence time of a social network
- The temporal aspects of the evidence-based influence maximization on social networks
- 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
Uses Software
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)
