Maximizing misinformation restriction within time and budget constraints

DOI10.1007/S10878-018-0252-3zbMath1400.90264OpenAlexW2788460644MaRDI QIDQ1752625

Bao Q. Bui, Huan X. Hoang, Hieu V. Duong, My T. Thai, Canh V. Pham

Publication date: 24 May 2018

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

Full work available at URL: https://doi.org/10.1007/s10878-018-0252-3

zbMATH Keywords

approximation algorithmsocial networksinformation diffusionmisinformation

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

Minimum budget for misinformation blocking in online social networks ⋮ Minimum budget for misinformation detection in online social networks with provable guarantees

Uses Software

• SIMPATH

Cites Work

• Unnamed Item
• The budgeted maximum coverage problem
• The Complexity of Enumeration and Reliability Problems

This page was built for publication: Maximizing misinformation restriction within time and budget constraints