approximation algorithm

A Graph-Theoretical Perspective on Law Design for Multiagent Systems AAAI 2026 A More Efficient Reduction from Outlier-Aware to Outlier-Free k-Median AAAI 2026 Approximation Algorithm for Constrained k-Center Clustering: A Local Search Approach AAAI 2026 A TSP-Based Algorithm for Multi-League Traveling Tournament AAAI 2026 Breaking Barriers, Finding Boundaries: Not Obviously Manipulable Budget-Feasible Mechanism Design AAAI 2026 City Sampling for Citizens’ Assemblies AAAI 2026 Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem AAAI 2026 Fairness in Repeated Matching: A Maximin Perspective AAAI 2026 Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications AAAI 2026 Greedily Maximizing Ex-Ante Fairness AAAI 2026 Improved Differentially Private Algorithms for Rank Aggregation AAAI 2026 Improved Fully Dynamic Submodular Maximization Under Matroid Constraints AAAI 2026 Improved Streaming Algorithm for Fair k-Center Clustering AAAI 2026 Linear Time Algorithms for Individually Fair k-means via Multi-Swap Local Search AAAI 2026 Minimizing Inequity in Facility Location Games AAAI 2026 Online Caching in Tree Networks: Algorithms, Regret, and Complexity L4DC 2026 Optimizing Health Coverage in Ethiopia: A Learning-augmented Approach and Persistent Proportionality Under an Online Budget AAAI 2026 Universal Safety Controllers with Learned Prophecies AAAI 2026 A (1+ε)-Approximation for Ultrametric Embedding in Subquadratic Time AAAI 2025 Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously AAAI 2025 Adaptive Threshold Sampling for Pure Exploration in Submodular Bandits UAI 2025 Adaptive Wizard for Removing Cross-Tier Misconfigurations in Active Directory IJCAI 2025 A Matching-Based Algorithm for the Traveling Tournament Problem AAAI 2025 An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale ICML 2025 An Information-theoretic Perspective of Hierarchical Clustering on Graphs UAI 2025