Co-occurring keywords · papers mentioning both
Papers
Improved Approximation Ratio for Strategyproof Facility Location on a Cycle
IJCAI 2025
Improved Approximations for Hard Graph Problems using Predictions
ICML 2025
Improved Fixed-Parameter Bounds for Min-Sum-Radii and Diameters k-Clustering and Their Fair Variants
AAAI 2025
Improved Maximin Share Approximations for Chores by Bin Packing
AAAI 2025
Improved MMS Approximations for Few Agent Types
IJCAI 2025
Improved Rank Aggregation Under Fairness Constraint
IJCAI 2025
Inapproximability of Optimal Multi-Agent Pathfinding Problems
AAAI 2025
Logarithmic Approximations for Fair k-Set Selection
IJCAI 2025
Mechanism Design for Connecting Regions Under Disruptions
AAAI 2025
Merging Mechanisms for Ads and Organic Items in E-commerce Platforms
AAAI 2025
More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
IJCAI 2025
Near-optimal Active Regression of Single-Index Models
ICLR 2025
New Algorithms for the Learning-Augmented k-means Problem
ICLR 2025
Non-Obvious Manipulability in Additively Separable and Fractional Hedonic Games
IJCAI 2025
OneBatchPAM: A Fast and Frugal K-Medoids Algorithm
AAAI 2025
Online and Streaming Algorithms for Constrained k-Submodular Maximization
AAAI 2025
Online Clustering with Nearly Optimal Consistency
ICLR 2025
On the Power of Randomization for Obviously Strategy-Proof Mechanisms
AAAI 2025
Optimal Metric Distortion for Matching on the Line
IJCAI 2025
Parameterized Approximation Algorithm for Doubly Constrained Fair Clustering
IJCAI 2025
Pre-Assignment Problem for Unique Minimum Vertex Cover on Bounded Clique-Width Graphs
AAAI 2025
Primal-Dual Neural Algorithmic Reasoning
ICML 2025
Proportionally Fair Makespan Approximation
AAAI 2025
Proportionally Fair Matching via Randomized Rounding
AAAI 2025
Provably Accurate Shapley Value Estimation via Leverage Score Sampling
ICLR 2025