Co-occurring keywords · papers mentioning both
Papers
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
NeurIPS 2023
Submodular Maximization under the Intersection of Matroid and Knapsack Constraints
AAAI 2023
Submodular Order Functions and Assortment Optimization
ICML 2023
Subset verification and search algorithms for causal DAGs
AISTATS 2023
The Gain from Ordering in Online Learning
NeurIPS 2023
The Linear Distance Traveling Tournament Problem Allows an EPTAS
AAAI 2023
The Power of Uniform Sampling for k-Median
ICML 2023
Triple Eagle: Simple, Fast and Practical Budget-Feasible Mechanisms
NeurIPS 2023
Truthful Mechanisms for Steiner Tree Problems
AAAI 2023
Weitzman's Rule for Pandora's Box with Correlations
NeurIPS 2023
Adapting k-means Algorithms for Outliers
ICML 2022
A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem
NeurIPS 2022
Algorithmic Bayesian Persuasion with Combinatorial Actions
AAAI 2022
Algorithms and Hardness for Learning Linear Thresholds from Label Proportions
NeurIPS 2022
A Little Charity Guarantees Fair Connected Graph Partitioning
AAAI 2022
A New Notion of Individually Fair Clustering: α-Equitable k-Center
AISTATS 2022
Approximately EFX Allocations for Indivisible Chores
IJCAI 2022
A Sampling-Based Approach for Efficient Clustering in Large Datasets
CVPR 2022
Better Private Algorithms for Correlation Clustering
COLT 2022
Chromatic Correlation Clustering, Revisited
NeurIPS 2022
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks
AISTATS 2022
Coreset for Line-Sets Clustering
NeurIPS 2022
Coresets for Data Discretization and Sine Wave Fitting
AISTATS 2022
Coresets for Relational Data and The Applications
NeurIPS 2022
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
ICML 2022