Minimizing the influence spread over a network through node interception

DOI10.1007/S11590-024-02117-WMaRDI QIDQ6968938zbMATH OpenFDO

Authors Shunyu Yao, Neng Fan, Pavlo A. Krokhmal

Publication date 23 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-024-02117-W

zbMATH Keywords

integer linear programminginfluence spreadinfluence minimizationdelayed constraint generation

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Graph theory (05Cxx) Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• An exact algorithm for robust influence maximization
• An integer linear programming formulation for removing nodes in a network to minimize the spread of influenza virus infections
• Collective dynamics of `small-world' networks
• Competitive Diffusion in Social Networks: Quality or Seeding?
• Critical arcs detection in influence networks
• Least cost influence propagation in (social) networks
• Lifted flow cover inequalities for mixed 0-1 integer programs
• Linear-programming-based lifting and its application to primal cutting-plane algorithms
• Methods for removing links in a network to minimize the spread of infections
• Modeling the spread of infectious diseases through influence maximization
• Node-Deletion Problems on Bipartite Graphs
• The critical node detection problem in networks: a survey
• The node-deletion problem for hereditary properties is NP-complete

This page was built for publication: Minimizing the influence spread over a network through node interception

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968938)