bicriteria approximation

Linear Time Algorithms for Individually Fair k-means via Multi-Swap Local Search AAAI 2026 A Subquadratic Time Approximation Algorithm for Individually Fair k-Center AISTATS 2025 Fair Submodular Cover ICLR 2025 A Dynamic Algorithm for Weighted Submodular Cover Problem ICML 2024 A Scalable Algorithm for Individually Fair k-Means Clustering AISTATS 2024 On Socially Fair Low-Rank Approximation and Column Subset Selection NeurIPS 2024 Bicriteria Approximation Algorithms for the Submodular Cover Problem NeurIPS 2023 Fast (1+ε)-Approximation Algorithms for Binary Matrix Factorization ICML 2023 Scalable Bicriteria Algorithms for Non-Monotone Submodular Cover AISTATS 2023 Improved Approximation Algorithms for Individually Fair Clustering AISTATS 2022 Improved Guarantees for k-means++ and k-means++ Parallel NeurIPS 2020 An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover IJCAI 2019 A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ NeurIPS 2016 A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NeurIPS 2015