approximation algorithm

AutoCoreset: An Automatic Practical Coreset Construction Framework ICML 2023 Bicriteria Approximation Algorithms for the Submodular Cover Problem NeurIPS 2023 Class Fairness in Online Matching AAAI 2023 Clustering What Matters: Optimal Approximation for Clustering with Outliers AAAI 2023 Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time IJCAI 2023 Constant Approximation for Individual Preference Stable Clustering NeurIPS 2023 Constraint Optimization over Semirings AAAI 2023 Core-sets for Fair and Diverse Data Summarization NeurIPS 2023 DASH: A Distributed and Parallelizable Algorithm for Size-Constrained Submodular Maximization AAAI 2023 Differentially Private Hierarchical Clustering with Provable Approximation Guarantees ICML 2023 Dimensionality Reduction for General KDE Mode Finding ICML 2023 Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint IJCAI 2023 Diversity Maximization in the Presence of Outliers AAAI 2023 Doubly Constrained Fair Clustering NeurIPS 2023 Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time ICML 2023 Dynamic Non-monotone Submodular Maximization NeurIPS 2023 Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers IJCAI 2023 Equity Promotion in Public Transportation AAAI 2023 Fair Allocation of Indivisible Chores: Beyond Additive Costs NeurIPS 2023 Fair, Polylog-Approximate Low-Cost Hierarchical Clustering NeurIPS 2023 Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization ICML 2023 Fast Algorithms for a New Relaxation of Optimal Transport COLT 2023 Fast Algorithms for Distributed k-Clustering with Outliers ICML 2023 Fast Combinatorial Algorithms for Min Max Correlation Clustering ICML 2023 Fast Distributed k-Means with a Small Number of Rounds AISTATS 2023