approximation algorithm

Approximate Forest Completion and Learning-Augmented Algorithms for Metric Minimum Spanning Trees ICML 2025 Approximately EFX and fPO Allocations for Bivalued Chores IJCAI 2025 Approximating Optimal Labelings for Temporal Connectivity AAAI 2025 Approximating the Total Variation Distance between Gaussians AISTATS 2025 Approximation algorithms for combinatorial optimization with predictions ICLR 2025 A Subquadratic Time Approximation Algorithm for Individually Fair k-Center AISTATS 2025 Blackwell’s Approachability with Approximation Algorithms COLT 2025 Computational Limits of Low-Rank Adaptation (LoRA) Fine-Tuning for Transformer Models ICLR 2025 Constant-Factor Distortion Mechanisms for k-Committee Election AAAI 2025 Deletion Robust Non-Monotone Submodular Maximization over Matroids JMLR 2025 Discovering Options That Minimize Average Planning Time AAAI 2025 Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges ICML 2025 EF2X Exists for Four Agents AAAI 2025 Efficient Sparse PCA via Block-Diagonalization ICLR 2025 Epistemic EFX Allocations Exist for Monotone Valuations AAAI 2025 Facility Location Games with Optional Preferences: A Revisit AAAI 2025 Fair Clustering in the Sliding Window Model ICLR 2025 Fair Submodular Cover ICLR 2025 Fair Submodular Maximization over a Knapsack Constraint IJCAI 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 Hierarchical Overlapping Clustering on Graphs: Cost Function, Algorithm and Scalability ICML 2025 Improved Approximation Algorithms for k-Submodular Maximization via Multilinear Extension ICLR 2025 Improved Approximation Algorithms for Clustered TSP and Subgroup Planning AAAI 2025