Recommending links through influence maximization

DOI10.1016/j.tcs.2018.01.017zbMath1417.68157arXiv1706.04368OpenAlexW2963975915WikidataQ130031986 ScholiaQ130031986MaRDI QIDQ1731508

Yllka Velaj, Gianlorenzo D'Angelo, Lorenzo Severini

Publication date: 13 March 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithminformation diffusioncomplex networksindependent cascade modelnetwork augmentation

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Approximation algorithms (68W25) Internet topics (68M11)

Related Items (10)

Positive influence maximization in signed social networks under independent cascade model ⋮ Unifying Online and Offline Preference for Social Link Prediction ⋮ Unnamed Item ⋮ A unified task recommendation strategy for realistic mobile crowdsourcing system ⋮ Influence maximization in the presence of vulnerable nodes: a ratio perspective ⋮ A new algorithm for positive influence maximization in signed networks ⋮ Whom to befriend to influence people ⋮ Unnamed Item ⋮ Generalized budgeted submodular set function maximization ⋮ Link prediction techniques, applications, and performance: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• The budgeted maximum coverage problem
• Whom to befriend to influence people
• The Design of Approximation Algorithms
• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Directed scale-free graphs

This page was built for publication: Recommending links through influence maximization