approximation algorithm

Deletion Robust Submodular Maximization over Matroids ICML 2022 Dependent randomized rounding for clustering and partition systems with knapsack constraints JMLR 2022 Differentially Private Densest Subgraph AISTATS 2022 Efficient and Stable Fully Dynamic Facility Location NeurIPS 2022 Efficient Submodular Optimization under Noise: Local Search is Robust NeurIPS 2022 Fair Disaster Containment via Graph-Cut Problems AISTATS 2022 Fair Rank Aggregation NeurIPS 2022 FLS: A New Local Search Algorithm for K-means with Smaller Search Space IJCAI 2022 From Sampling to Optimization on Discrete Domains with Applications to Determinant Maximization COLT 2022 Generalized Stochastic Matching AAAI 2022 Giga-scale Kernel Matrix-Vector Multiplication on GPU NeurIPS 2022 Hardness and Algorithms for Robust and Sparse Optimization ICML 2022 Hardness of Maximum Likelihood Learning of DPPs COLT 2022 Heterogeneous Facility Location with Limited Resources AAAI 2022 Improved Approximation Algorithms for Individually Fair Clustering AISTATS 2022 Improved Coresets for Euclidean k-Means NeurIPS 2022 Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem AAAI 2022 Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem COLT 2022 I Will Have Order! Optimizing Orders for Fair Reviewer Assignment IJCAI 2022 Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error AAAI 2022 Massively Parallel k-Means Clustering for Perturbation Resilient Instances ICML 2022 Maximizing Nash Social Welfare in 2-Value Instances AAAI 2022 Maxmin Participatory Budgeting IJCAI 2022 Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space IJCAI 2022 Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NeurIPS 2022