← Optimization
Mathematics & Optimization › Optimization ›

Approximation Algorithms

110 directly classified papers

Papers per year

Papers

Fairness in Influence Maximization through Randomization AAAI 2021
On the PTAS for Maximin Shares in an Indivisible Mixed Manna AAAI 2021
Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NIPS 2021
Fair Scheduling for Time-dependent Resources NIPS 2021
Large-Scale Learning with Fourier Features and Tensor Decompositions NIPS 2021
Adversarial Blocking Bandits NIPS 2020
Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nystrom method NIPS 2020
Fourier Sparse Leverage Scores and Approximate Kernel Learning NIPS 2020
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time NIPS 2020
Defending with Shared Resources on a Network AAAI 2020
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability AAAI 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NIPS 2020
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics NIPS 2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness NIPS 2020
SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm NIPS 2020
Approximation and Hardness of Shift-Bribery AAAI 2019
k-Means Clustering of Lines for Big Data NIPS 2019
Greedy Sampling for Approximate Clustering in the Presence of Outliers NIPS 2019
A Graph Theoretic Additive Approximation of Optimal Transport NIPS 2019
Approximating the Permanent by Sampling from Adaptive Partitions NIPS 2019
Towards a Zero-One Law for Column Subset Selection NIPS 2019
Fully Dynamic Consistent Facility Location NIPS 2019
Using Benson’s Algorithm for Regularization Parameter Tracking AAAI 2019
Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm AAAI 2019
Randomized Strategies for Robust Combinatorial Optimization AAAI 2019