greedy algorithm

Approximate Supermodularity Bounds for Experimental Design NeurIPS 2017 A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents IJCAI 2017 Efficient Inference and Computation of Optimal Alternatives for Preference Languages Based On Lexicographic Models IJCAI 2017 Elementary Symmetric Polynomials for Optimal Experimental Design NeurIPS 2017 Fair and Efficient Social Choice in Dynamic Settings IJCAI 2017 Faster Greedy MAP Inference for Determinantal Point Processes ICML 2017 Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization COLT 2017 Greedy Algorithms for Cone Constrained Optimization with Convergence Guarantees NeurIPS 2017 Guarantees for Greedy Maximization of Non-submodular Functions with Applications ICML 2017 No Time to Observe: Adaptive Influence Maximization with Partial Feedback IJCAI 2017 On Approximation Guarantees for Greedy Low Rank Optimization ICML 2017 On Computationally Tractable Selection of Experiments in Measurement-Constrained Regression Models JMLR 2017 Online Summarization via Submodular and Convex Optimization CVPR 2017 On Subset Selection with General Cost Constraints IJCAI 2017 Optimizing Ratio of Monotone Set Functions IJCAI 2017 Probabilistic Submodular Maximization in Sub-Linear Time ICML 2017 Robust Guarantees of Stochastic Greedy Algorithms ICML 2017 Scalable Greedy Feature Selection via Weak Submodularity AISTATS 2017 Scaling Submodular Maximization via Pruned Submodularity Graphs AISTATS 2017 Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NeurIPS 2017 Subset Selection under Noise NeurIPS 2017 The limits of automatic summarisation according to ROUGE EACL 2017 Towards Abstractive Multi-Document Summarization Using Submodular Function-Based Framework, Sentence Compression and Merging IJCNLP 2017 Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint NeurIPS 2016 An Efficient Streaming Algorithm for the Submodular Cover Problem NeurIPS 2016