approximation algorithm

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers NeurIPS 2023 Finding Safe Zones of Markov Decision Processes Policies NeurIPS 2023 Fully Dynamic Submodular Maximization over Matroids ICML 2023 Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost ICML 2023 How Do You Want Your Greedy: Simultaneous or Repeated? JMLR 2023 Improved Algorithm for Regret Ratio Minimization in Multi-Objective Submodular Maximization AAAI 2023 Improved Approximation for Fair Correlation Clustering AISTATS 2023 Improved Learning-augmented Algorithms for k-means and k-medians Clustering ICLR 2023 Incentive-Compatible Selection for One or Two Influentials IJCAI 2023 Iterative Approximate Cross-Validation ICML 2023 Last Switch Dependent Bandits with Monotone Payoff Functions ICML 2023 Learning Small Decision Trees with Large Domain IJCAI 2023 Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint IJCAI 2023 Linear Time Algorithms for k-means with Multi-Swap Local Search NeurIPS 2023 Maximization of Minimum Weighted Hamming Distance between Set Pairs ACML 2023 Maximizing submodular functions under submodular constraints UAI 2023 Meek Separators and Their Applications in Targeted Causal Discovery NeurIPS 2023 Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier AISTATS 2023 Min-Max Submodular Ranking for Multiple Agents AAAI 2023 Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule AAAI 2023 Multi-class Graph Clustering via Approximated Effective p-Resistance ICML 2023 Multi-Stage Facility Location Problems with Transient Agents AAAI 2023 Multi-Swap k-Means++ NeurIPS 2023 Near-Linear Time Algorithm for the Chamfer Distance NeurIPS 2023 Nearly-Optimal Hierarchical Clustering for Well-Clustered Graphs ICML 2023