scientific article; zbMATH DE number 7204409

DOI10.4230/LIPICS.MFCS.2017.75zbMATH Open1441.68171arXiv1706.06466MaRDI QIDQ5111292FDOQ5111292

Gianlorenzo D'Angelo, Yllka Velaj, Lorenzo Severini

Publication date: 26 May 2020

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

Title of this publication is not available (Why is that?)

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

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)

Cites Work

• A New Product Growth for Model Consumer Durables
• Title not available (Why is that?)
• The budgeted maximum coverage problem
• Contact network epidemiology: Bond percolation applied to infectious disease prediction and control
• On the maximum betweenness improvement problem
• Recommending links through influence maximization

Cited In (5)

• Recommending links through influence maximization
• Title not available (Why is that?)
• Whom to befriend to influence people
• 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)