approximation guarantee

Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints AAAI 2019 Greedy Sampling for Approximate Clustering in the Presence of Outliers NeurIPS 2019 Multivariate Submodular Optimization ICML 2019 New results on information theoretic clustering ICML 2019 Stochastic Continuous Greedy ++: When Upper and Lower Bounds Match NeurIPS 2019 Submodular Maximization beyond Non-negativity: Guarantees, Fast Algorithms, and Applications ICML 2019 Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity ICML 2019 A Faster Sampling Algorithm for Spherical k-means ACML 2018 Approximation Guarantees for Adaptive Sampling ICML 2018 Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection IJCAI 2018 Conditional Gradient Method for Stochastic Submodular Maximization: Closing the Gap AISTATS 2018 Decentralized Submodular Maximization: Bridging Discrete and Continuous Settings ICML 2018 Distributed Clustering via LSH Based Data Partitioning ICML 2018 Hierarchical Clustering with Structural Constraints ICML 2018 Non-monotone Submodular Maximization in Exponentially Fewer Iterations NeurIPS 2018 Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function NAACL 2018 Sequence Selection by Pareto Optimization IJCAI 2018 Continuous DR-submodular Maximization: Structure and Algorithms NeurIPS 2017 Elementary Symmetric Polynomials for Optimal Experimental Design NeurIPS 2017 Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains AISTATS 2017 On Approximation Guarantees for Greedy Low Rank Optimization ICML 2017 Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NeurIPS 2017 A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ NeurIPS 2016 An Efficient Streaming Algorithm for the Submodular Cover Problem NeurIPS 2016 Fast Constrained Submodular Maximization: Personalized Data Summarization ICML 2016