Influence Maximization with Latency Requirements on Social Networks
From MaRDI portal
Publication:5085986
DOI10.1287/ijoc.2021.1095OpenAlexW3211542941MaRDI QIDQ5085986
No author found.
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New dominating sets in social networks
- On positive influence dominating sets in social networks
- Approximation hardness of dominating set problems in bounded degree graphs
- The Steiner tree polytope and related polyhedra
- Least cost influence propagation in (social) networks
- A two-stage stochastic programming approach for influence maximization in social networks
- On the approximability of positive influence dominating set in social networks
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
- Mixed Integer Linear Programming Formulation Techniques
- 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
- Integer Programming
- Least-Cost Influence Maximization on Social Networks
- On the Approximability of Influence in Social Networks
- Positive Influence Dominating Set in Online Social Networks
- Formulating a Mixed Integer Programming Problem to Improve Solvability
- Why Is Maximum Clique Often Easy in Practice?
- Maximizing Social Influence in Nearly Optimal Time
- An exact algorithm for robust influence maximization
- A branch‐and‐cut approach for the least cost influence problem on social networks
This page was built for publication: Influence Maximization with Latency Requirements on Social Networks
