Approximation Algorithms
162 papers
Papers per year
2
3
3
1
5
2
2
6
9
8
6
12
11
11
10
12
16
20
20
3
'10
'15
'20
'25
Papers
Large-Scale Learning with Fourier Features and Tensor Decompositions
NeurIPS 2021
Maximization of Monotone k-Submodular Functions with Bounded Curvature and Non-k-Submodular Functions
ACML 2021
On the PTAS for Maximin Shares in an Indivisible Mixed Manna
AAAI 2021
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
AAAI 2021
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices
AAAI 2021
The Traveling Tournament Problem with Maximum Tour Length Two: A Practical Algorithm with An Improved Approximation Bound
IJCAI 2021
Adversarial Blocking Bandits
NeurIPS 2020
Defending with Shared Resources on a Network
AAAI 2020
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
NeurIPS 2020
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
AAAI 2020
Fairness in Streaming Submodular Maximization: Algorithms and Hardness
NeurIPS 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
NeurIPS 2020
Fourier Sparse Leverage Scores and Approximate Kernel Learning
NeurIPS 2020
Hierarchical Clustering: A 0.585 Revenue Approximation
COLT 2020
Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics
NeurIPS 2020
Improved guarantees and a multiple-descent curve for Column Subset Selection and the Nystrom method
NeurIPS 2020
SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm
NeurIPS 2020
A Graph Theoretic Additive Approximation of Optimal Transport
NeurIPS 2019
Approximating the Permanent by Sampling from Adaptive Partitions
NeurIPS 2019
Approximation and Hardness of Shift-Bribery
AAAI 2019
Combinatorial Algorithms for Optimal Design
COLT 2019
Election with Bribed Voter Uncertainty: Hardness and Approximation Algorithm
AAAI 2019
Fully Dynamic Consistent Facility Location
NeurIPS 2019
Greedy Sampling for Approximate Clustering in the Presence of Outliers
NeurIPS 2019
k-Means Clustering of Lines for Big Data
NeurIPS 2019