← Optimization
Mathematics & Optimization › Optimization ›

Approximation Algorithms

110 directly classified papers

Papers per year

Papers

Robust Subspace Approximation in a Stream NIPS 2018
Hierarchical Clustering with Structural Constraints ICML 2018
Distributed $k$-Clustering for Data with Heavy Noise NIPS 2018
Approximation algorithms for stochastic clustering NIPS 2018
Non-monotone Submodular Maximization in Exponentially Fewer Iterations NIPS 2018
Online Improper Learning with an Approximation Oracle NIPS 2018
Norm-Ranging LSH for Maximum Inner Product Search NIPS 2018
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization NIPS 2018
Optimization for Approximate Submodularity NIPS 2018
Recursive Sampling for the Nystrom Method NIPS 2017
Beyond Worst-case: A Probabilistic Analysis of Affine Policies in Dynamic Optimization NIPS 2017
Approximation Algorithms for $\ell_0$-Low Rank Approximation NIPS 2017
Efficient Approximation Algorithms for Strings Kernel Based Sequence Classification NIPS 2017
The Importance of Communities for Learning to Influence NIPS 2017
Gaussian Quadrature for Kernel Features NIPS 2017
Sublinear Time Orthogonal Tensor Decomposition NIPS 2016
The Power of Optimization from Samples NIPS 2016
Simple and Efficient Weighted Minwise Hashing NIPS 2016
Maximization of Approximately Submodular Functions NIPS 2016
A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ NIPS 2016
Distributed Submodular Cover: Succinctly Summarizing Massive Data NIPS 2015
Optimal Rates for Random Fourier Features NIPS 2015
Parallel Double Greedy Submodular Maximization NIPS 2014
Fast Rotation Search with Stereographic Projections for 3D Registration CVPR 2014
Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints NIPS 2013