Approximation Algorithms

Approximations and Learning for Continuous State and Action MDPs under Average Cost Criteria JMLR 2026 Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem AAAI 2026 MUSS: Multilevel Subset Selection for Relevance and Diversity UAI 2026 A (1+ε)-Approximation for Ultrametric Embedding in Subquadratic Time AAAI 2025 A Matching-Based Algorithm for the Traveling Tournament Problem AAAI 2025 An Information-theoretic Perspective of Hierarchical Clustering on Graphs UAI 2025 Approximating Optimal Labelings for Temporal Connectivity AAAI 2025 Approximation algorithms for combinatorial optimization with predictions ICLR 2025 A Subquadratic Time Approximation Algorithm for Individually Fair k-Center AISTATS 2025 Efficient Sparse PCA via Block-Diagonalization ICLR 2025 Fair Division via the Cake-Cutting Share AAAI 2025 Fair Submodular Cover ICLR 2025 Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time AISTATS 2025 Fully-Scalable Massively Parallel Algorithm for k-center with Outliers AAAI 2025 Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints AAAI 2025 Improved Approximation Algorithms for k-Submodular Maximization via Multilinear Extension ICLR 2025 Improved Approximation Algorithms for Clustered TSP and Subgroup Planning AAAI 2025 Near-optimal Active Regression of Single-Index Models ICLR 2025 OneBatchPAM: A Fast and Frugal K-Medoids Algorithm AAAI 2025 Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025 Online Clustering with Nearly Optimal Consistency ICLR 2025 Relax and Merge: A Simple Yet Effective Framework for Solving Fair k-Means and k-sparse Wasserstein Barycenter Problems ICLR 2025 Towards Real-Time Approximate Counting AAAI 2025 A Greedy Approximation for k-Determinantal Point Processes AISTATS 2024 Approximate Integer Solution Counts over Linear Arithmetic Constraints AAAI 2024