Minimum budget for misinformation blocking in online social networks

DOI10.1007/S10878-019-00439-5zbMATH Open1431.91309OpenAlexW2963646940MaRDI QIDQ2279752FDOQ2279752

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

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

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

zbMATH Keywords

optimizationsocial networkapproximation algorithmmisinformation

Mathematics Subject Classification ID

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

Cites Work

• The Complexity of Enumeration and Reliability Problems
• Complexity of finding dense subgraphs
• Title not available (Why is that?)
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Title not available (Why is that?)
• Maximizing misinformation restriction within time and budget constraints

Cited In (2)

• Minimizing the Spread of Rumor Within Budget Constraint in Online Network
• A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities

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)