approximation algorithm

Order Statistics for Probabilistic Graphical Models IJCAI 2017 Pessimistic Leader-Follower Equilibria with Multiple Followers IJCAI 2017 Robust Advertisement Allocation IJCAI 2017 Robust Guarantees of Stochastic Greedy Algorithms ICML 2017 Robust Optimization for Non-Convex Objectives NeurIPS 2017 Robust Submodular Maximization: A Non-Uniform Partitioning Approach ICML 2017 Sparse Approximate Conic Hulls NeurIPS 2017 Subset Selection under Noise NeurIPS 2017 The Importance of Communities for Learning to Influence NeurIPS 2017 A Bounded p-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors JMLR 2016 A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ NeurIPS 2016 Algorithms for Optimizing the Ratio of Submodular Functions ICML 2016 An Efficient Streaming Algorithm for the Submodular Cover Problem NeurIPS 2016 Approximate maximum entropy principles via Goemans-Williamson with applications to provable variational methods NeurIPS 2016 Bipartite Correlation Clustering: Maximizing Agreements AISTATS 2016 Correlation Clustering and Biclustering with Locally Bounded Errors ICML 2016 Distributed Submodular Maximization JMLR 2016 Hierarchical Clustering via Spreading Metrics NeurIPS 2016 K-Means Clustering with Distributed Dimensions ICML 2016 Linear Relaxations for Finding Diverse Elements in Metric Spaces NeurIPS 2016 Maximization of Approximately Submodular Functions NeurIPS 2016 On the Approximability of Sparse PCA COLT 2016 Simple and Efficient Weighted Minwise Hashing NeurIPS 2016 Solving Marginal MAP Problems with NP Oracles and Parity Constraints NeurIPS 2016 Speeding up k-means by approximating Euclidean distances via block vectors ICML 2016