暂无分享,去创建一个
[1] Hui Lin,et al. A Class of Submodular Functions for Document Summarization , 2011, ACL.
[2] Andreas Krause,et al. Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization , 2010, J. Artif. Intell. Res..
[3] Silvio Lattanzi,et al. Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity , 2019, ICML.
[4] Morteza Zadimoghaddam,et al. Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity , 2018, SODA.
[5] L. Wolsey. Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems , 1982, Math. Oper. Res..
[6] Shuguang Cui,et al. Streaming Algorithms for News and Scientific Literature Recommendation: Monotone Submodular Maximization With a $d$ -Knapsack Constraint , 2018, IEEE Access.
[7] Carlos Guestrin,et al. Beyond keyword search: discovering relevant scientific literature , 2011, KDD.
[8] Alexandr Andoni,et al. Parallel algorithms for geometric graph problems , 2013, STOC.
[9] Jan Vondrák,et al. Submodular Optimization in the MapReduce Model , 2018, SOSA.
[10] Morteza Zadimoghaddam,et al. Fast Distributed Submodular Cover: Public-Private Data Summarization , 2016, NIPS.
[11] Huy L. Nguyen,et al. Submodular Maximization with Nearly-optimal Approximation and Adaptivity in Nearly-linear Time , 2018, SODA.
[12] Kent Quanrud,et al. Submodular Function Maximization in Parallel via the Multilinear Relaxation , 2019, SODA.
[13] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[14] Jure Leskovec,et al. {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .
[15] Thorsten Joachims,et al. Temporal corpus summarization using submodular word coverage , 2012, CIKM '12.
[16] Clifford Stein,et al. Submodular Secretary Problem with Shortlists , 2018, ITCS.
[17] Jan Vondrák,et al. Fast algorithms for maximizing submodular functions , 2014, SODA.
[18] Morteza Zadimoghaddam,et al. Randomized Composable Core-sets for Distributed Submodular Maximization , 2015, STOC.
[19] Andreas Krause,et al. Streaming Non-monotone Submodular Maximization: Personalized Video Summarization on the Fly , 2017, AAAI.
[20] Alexandros G. Dimakis,et al. Streaming Weak Submodularity: Interpreting Neural Networks on the Fly , 2017, NIPS.
[21] Vahab S. Mirrokni,et al. Optimal Distributed Submodular Optimization via Sketching , 2018, KDD.
[22] Roy Schwartz,et al. Online Submodular Maximization with Preemption , 2015, SODA.
[23] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[24] Andreas Krause,et al. Budgeted Nonparametric Learning from Data Streams , 2010, ICML.
[25] Ola Svensson,et al. Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams , 2018, ICML.
[26] Alexandros G. Dimakis,et al. Leveraging Sparsity for Efficient Submodular Data Summarization , 2017, NIPS.
[27] Vahab S. Mirrokni,et al. Optimal marketing strategies over social networks , 2008, WWW.
[28] Volkan Cevher,et al. Robust Submodular Maximization: A Non-Uniform Partitioning Approach , 2017, ICML.
[29] Sergei Vassilvitskii,et al. Fast greedy algorithms in mapreduce and streaming , 2013, SPAA.
[30] Eric Balkanski,et al. An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation , 2018, SODA.
[31] Andreas Krause,et al. Distributed Submodular Maximization: Identifying Representative Elements in Massive Data , 2013, NIPS.
[32] Silvio Lattanzi,et al. Submodular Optimization Over Sliding Windows , 2016, WWW.
[33] Yuichi Yoshida,et al. Streaming Algorithms for Maximizing Monotone Submodular Functions Under a Knapsack Constraint , 2017, Algorithmica.
[34] Huy L. Nguyen,et al. A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint , 2019, ICALP.
[35] Oluwasanmi Koyejo,et al. Sparse Submodular Probabilistic PCA , 2015, AISTATS.
[36] Andreas Krause,et al. Streaming submodular maximization: massive data summarization on the fly , 2014, KDD.
[37] Amit Chakrabarti,et al. Submodular maximization meets streaming: matchings, matroids, and more , 2013, Math. Program..
[38] Huy L. Nguyen,et al. The Power of Randomization: Distributed Submodular Maximization on Massive Datasets , 2015, ICML.
[39] T.-H. Hubert Chan,et al. Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids , 2017, SODA.
[40] Kent Quanrud,et al. Streaming Algorithms for Submodular Function Maximization , 2015, ICALP.
[41] Eric Balkanski,et al. The adaptive complexity of maximizing a submodular function , 2018, STOC.
[42] Mohit Singh,et al. Structured Robust Submodular Maximization: Offline and Online Algorithms , 2017, AISTATS.
[43] Volkan Cevher,et al. Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach , 2017, NIPS.
[44] Rishabh K. Iyer,et al. Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs , 2019, AISTATS.
[45] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[46] Jeff A. Bilmes,et al. Using Document Summarization Techniques for Speech Data Subset Selection , 2013, NAACL.
[47] Sergei Vassilvitskii,et al. A model of computation for MapReduce , 2010, SODA '10.
[48] Huy L. Nguyen,et al. A New Framework for Distributed Submodular Maximization , 2015, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).
[49] Amin Karbasi,et al. Do Less, Get More: Streaming Submodular Maximization with Subsampling , 2018, NeurIPS.
[50] Naonori Kakimura,et al. Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization , 2018, Theory Comput. Syst..
[51] Jan Vondrák,et al. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..
[52] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..