Minimizing the Spread of Rumor Within Budget Constraint in Online Network

DOI10.1007/978-981-15-0105-0_9zbMath1458.91174OpenAlexW2971008900MaRDI QIDQ3305478

Zhiyong Peng, Songsong Mo, Shan Tian, Liwei Wang

Publication date: 7 August 2020

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-981-15-0105-0_9

zbMATH Keywords

random walksocial networkbudget constraintrumor control

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Cites Work

• The budgeted maximum coverage problem
• An analysis of approximations for maximizing submodular set functions—I
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimizing the Spread of Rumor Within Budget Constraint in Online Network