← Optimization
Mathematics & Optimization › Optimization ›

Approximation Algorithms

110 directly classified papers

Papers per year

Papers

Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem AAAI 2026
Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025
Towards Real-Time Approximate Counting AAAI 2025
Heterogeneous Multi-Robot Graph Coverage with Proximity and Movement Constraints AAAI 2025
Approximating Optimal Labelings for Temporal Connectivity AAAI 2025
Improved Approximation Algorithms for Clustered TSP and Subgroup Planning AAAI 2025
Fully-Scalable Massively Parallel Algorithm for k-center with Outliers AAAI 2025
A (1+ε)-Approximation for Ultrametric Embedding in Subquadratic Time AAAI 2025
Fair Division via the Cake-Cutting Share AAAI 2025
OneBatchPAM: A Fast and Frugal K-Medoids Algorithm AAAI 2025
A Matching-Based Algorithm for the Traveling Tournament Problem AAAI 2025
A Greedy Approximation for k-Determinantal Point Processes AISTATS 2024
Parameterized Approximation Schemes for Fair-Range Clustering NIPS 2024
Efficient Centroid-Linkage Clustering NIPS 2024
Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems NIPS 2024
Randomized Strategic Facility Location with Predictions NIPS 2024
On Socially Fair Low-Rank Approximation and Column Subset Selection NIPS 2024
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint NIPS 2024
Public Event Scheduling with Busy Agents IJCAI 2024
Efficient Constrained K-center Clustering with Background Knowledge AAAI 2024
Approximate Integer Solution Counts over Linear Arithmetic Constraints AAAI 2024
SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI 2024
Approximation Scheme for Weighted Metric Clustering via Sherali-Adams AAAI 2024
Approximation Algorithms for Preference Aggregation Using CP-Nets AAAI 2024
Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants AAAI 2024