scientific article; zbMATH DE number 7204409

DOI10.4230/LIPICS.MFCS.2017.75MaRDI QIDQ5111292zbMATH OpenFDO

Authors Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj

Publication date 26 May 2020

Full work available at URL https://arxiv.org/abs/1706.06466

zbMATH Keywords

approximation algorithmscomplex networksinformation diffusionindependent cascade modelnetwork augmentation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation algorithms (68W25)

Recommendations

• Seeding with costly network information
• Automata, Languages and Programming
• Maximizing social influence in nearly optimal time
• Fast and frugal targeting with incentives
• Efficient influence maximization under TSCM: a suitable diffusion model in online social networks

Cites work

• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• A new product growth for model consumer durables
• Contact network epidemiology: Bond percolation applied to infectious disease prediction and control
• On the maximum betweenness improvement problem
• Recommending links through influence maximization
• The budgeted maximum coverage problem

Cited in

(5)

• Recommending links through influence maximization
• Seeding with costly network information
• Generalized budgeted submodular set function maximization
• Generalized budgeted submodular set function maximization
• Fast and frugal targeting with incentives

This page was built for publication:

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