Influence maximization with latency requirements on social networks

DOI10.1287/IJOC.2021.1095OpenAlexW3211542941MaRDI QIDQ5085986FDOQ5085986

Author name not available (Why is that?)

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

zbMATH Keywords

social networksmixed integer programminginfluence maximizationstrong modelslatency constraints

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

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 (4)

• Minimizing the expected complete influence time of a social network
• The temporal aspects of the evidence-based influence maximization on social networks
• On the shoulders of giants: incremental influence maximization in evolving social networks
• Latency-bounded target set selection in social networks

Uses Software

• SNAP
• CELF++

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)