Online algorithms for BP functions maximization

[1]  Hui Lin,et al.  A Class of Submodular Functions for Document Summarization , 2011, ACL.

[2]  Andreas Krause,et al.  Near-optimal Nonmyopic Value of Information in Graphical Models , 2005, UAI.

[3]  Wenruo Bai,et al.  Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions , 2018, ICML.

[4]  Hui Lin,et al.  Multi-document Summarization via Budgeted Maximization of Submodular Functions , 2010, NAACL.

[5]  Roy Schwartz,et al.  Online Submodular Maximization with Preemption , 2015, SODA.

[6]  Yossi Azar,et al.  Submodular Max-SAT , 2011, ESA.

[7]  Andreas Krause,et al.  Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .

[8]  Andreas S. Schulz,et al.  Approximating the least core value and least core of cooperative games with supermodular costs , 2013, Discret. Optim..

[9]  Gérard Cornuéjols,et al.  Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..

[10]  Andreas Krause,et al.  Near-optimal Observation Selection using Submodular Functions , 2007, AAAI.

[11]  Andreas Krause,et al.  Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..

[12]  Hui Lin,et al.  Word Alignment via Submodular Maximization over Matroids , 2011, ACL.

[13]  C. Guestrin,et al.  Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[14]  Xiaoyan Zhang,et al.  Online BP Functions Maximization , 2020, AAIM.

[15]  Rishabh K. Iyer,et al.  Submodularity in Data Subset Selection and Active Learning , 2015, ICML.

[16]  Tim Roughgarden,et al.  Revenue submodularity , 2009, EC '09.