Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization

DOI10.1145/3313904MaRDI QIDQ5205807zbMATH OpenOpenAlexFDO

Authors Grant Schoenebeck, Biaoshuai Tao

Publication date 16 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3313904

zbMATH Keywords

(non)submodular optimizationapproximabilityinfluence maximization

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Recommendations

• Beyond worst-case (in)approximability of nonsubmodular influence maximization
• Parameterized approximability of maximizing the spread of influence in networks
• Parameterized approximability of maximizing the spread of influence in networks
• Better approximation algorithms for influence maximization in online social networks
• Influence Maximization in Undirected Networks
• A Multi-criteria Approximation Algorithm for Influence Maximization with Probabilistic Guarantees
• Influence maximization under the non-progressive linear threshold model
• Efficient presolving methods for the influence maximization problem
• The complexity of influence maximization problem in the deterministic linear threshold model
• A polyhedral approach to least cost influence maximization in social networks

Cited in

(7)

• On strict submodularity of social influence
• Think globally, act locally: on the optimal seeding for nonsubmodular influence maximization
• Beyond worst-case (in)approximability of nonsubmodular influence maximization
• Generalized nonbacktracking bounds on the influence
• Seeding with costly network information
• scientific article; zbMATH DE number 7650106 (Why is no real title available?)
• Parameterized complexity of influence maximization

This page was built for publication: Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization

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