approximation ratio

FPT Approximation Algorithms for TSP on Non-Metric Graphs AAAI 2026 On the Approximation Ratio of Optimal Fixed-Price Mechanisms for Single and Multi-Unit Bilateral Trade AAAI 2026 A Matching-Based Algorithm for the Traveling Tournament Problem AAAI 2025 Breaking Barriers: Combinatorial Algorithms for Non-Monotone Submodular Maximization with Sublinear Adaptivity and $1/e$ Approximation ICML 2025 Correlation Clustering Beyond the Pivot Algorithm ICML 2025 Improved Approximation Ratio for Strategyproof Facility Location on a Cycle IJCAI 2025 Mechanism Design for Connecting Regions Under Disruptions AAAI 2025 Relax and Merge: A Simple Yet Effective Framework for Solving Fair k-Means and k-sparse Wasserstein Barycenter Problems ICLR 2025 Altruism in Facility Location Problems AAAI 2024 Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS ICML 2024 Deletion-Robust Submodular Maximization with Knapsack Constraints AAAI 2024 Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization NeurIPS 2024 On the Capacitated Facility Location Problem with Scarce Resources UAI 2024 Quality-Diversity Algorithms Can Provably Be Helpful for Optimization IJCAI 2024 Strategyproof Mechanisms for Group-Fair Obnoxious Facility Location Problems AAAI 2024 Truthful Interval Covering IJCAI 2024 Approximation Bounds for Hierarchical Clustering: Average Linkage, Bisecting K-means, and Local Search JMLR 2023 Facility Location Games with Entrance Fees AAAI 2023 Mini-batch k-means terminates within O(d/ε) iterations ICLR 2023 Multi-Stage Facility Location Problems with Transient Agents AAAI 2023 Scalable and Effective Conductance-Based Graph Clustering AAAI 2023 Truthful Mechanisms for Steiner Tree Problems AAAI 2023 Approximate Strategyproof Mechanisms for the Additively Separable Group Activity Selection Problem IJCAI 2022 Efficient Resource Allocation with Secretive Agents IJCAI 2022 Generalized Stochastic Matching AAAI 2022