approximation algorithm

Norm-Ranging LSH for Maximum Inner Product Search NeurIPS 2018 Online Improper Learning with an Approximation Oracle NeurIPS 2018 On Misinformation Containment in Online Social Networks NeurIPS 2018 Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization NeurIPS 2018 Robust Maximization of Non-Submodular Objectives AISTATS 2018 Sampling-Based Approximation Algorithms for Reachability Analysis with Provable Guarantees RSS 2018 Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints ICML 2018 Submodularity on Hypergraphs: From Sets to Sequences AISTATS 2018 Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? ICML 2018 An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization IJCAI 2017 Approximation Algorithms for ℓ_0-Low Rank Approximation NeurIPS 2017 Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search NeurIPS 2017 Balancing information exposure in social networks NeurIPS 2017 Clustering High Dimensional Dynamic Data Streams ICML 2017 Computing an Approximately Optimal Agreeable Set of Items IJCAI 2017 Consistent k-Clustering ICML 2017 Differentially Private Submodular Maximization: Data Summarization in Disguise ICML 2017 Efficient Approximation Algorithms for Strings Kernel Based Sequence Classification NeurIPS 2017 Efficient Online Linear Optimization with Approximation Algorithms NeurIPS 2017 Hierarchical Clustering Beyond the Worst-Case NeurIPS 2017 Hierarchical Clustering via Spreading Metrics JMLR 2017 Inapproximability of VC Dimension and Littlestone’s Dimension COLT 2017 Influence Maximization with ε-Almost Submodular Threshold Functions NeurIPS 2017 Minimizing a Submodular Function from Samples NeurIPS 2017 Near-Optimal Design of Experiments via Regret Minimization ICML 2017