Minimum budget for misinformation blocking in online social networks

DOI10.1007/S10878-019-00439-5MaRDI QIDQ2279752zbMATH OpenOpenAlexFDO

Authors Canh V. Pham, Quat V. Phu, Huan X. Hoang, Jun Pei, My T. Thai

Publication date 13 December 2019

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-019-00439-5

zbMATH Keywords

approximation algorithmmisinformationoptimizationsocial network

Mathematics Subject Classification ID

Approximation algorithms (68W25) Social networks; opinion dynamics (91D30)

Recommendations

• Maximizing misinformation restriction within time and budget constraints
• Minimum budget for misinformation detection in online social networks with provable guarantees
• Community-based rumor blocking maximization in social networks: algorithms and analysis
• Minimizing the Spread of Rumor Within Budget Constraint in Online Network
• Community-based rumor blocking maximization in social networks

Cites work

• Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
• Complexity of finding dense subgraphs
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 1931795 (Why is no real title available?)
• Maximizing misinformation restriction within time and budget constraints
• The Complexity of Enumeration and Reliability Problems

Cited in

(13)

• Maximizing misinformation restriction within time and budget constraints
• Community-based rumor blocking maximization in social networks
• Minimum budget for misinformation detection in online social networks with provable guarantees
• Community-based rumor blocking maximization in social networks: algorithms and analysis
• Improved x-space algorithm for min-max bilevel problems with an application to misinformation spread in social networks
• Optimal containment of misinformation in social media: a scenario-based approach
• Minimizing the Spread of Rumor Within Budget Constraint in Online Network
• Contrasting the spread of misinformation in online social networks
• Misinformation influence minimization problem based on group disbanded in social networks
• A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities
• Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint
• Efficient parallel algorithm for minimum cost submodular cover problem with lower adaptive complexity
• Practical algorithm for minimum cost submodular cover problem with performance guarantees

This page was built for publication: Minimum budget for misinformation blocking in online social networks

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