Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions

DOI10.1137/1.9781611974331.ch31zbMath1423.90157arXiv1507.02351OpenAlexW2951391163MaRDI QIDQ4575608

Ashwinkumar Badanidiyuru, Aviad Rubinstein, Yaron Singer, Lior Seeman, Christos H. Papadimitriou

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Stochastic programming (90C15) Approximation algorithms (68W25)

Related Items (4)

Better bounds on the adaptivity gap of influence maximization under full-adoption feedback ⋮ Unnamed Item ⋮ Generalized budgeted submodular set function maximization ⋮ An adaptive algorithm for maximization of non-submodular function with a matroid constraint

This page was built for publication: Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions