Co-occurring keywords · papers mentioning both
Papers
A Combinatorial Approach to Neural Emergent Communication
COLING 2025
A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem
NeurIPS 2024
Discretely beyond $1/e$: Guided Combinatorial Algortihms for Submodular Maximization
NeurIPS 2024
A Combinatorial Algorithm for Approximating the Optimal Transport in the Parallel and MPC Settings
NeurIPS 2023
Fast Combinatorial Algorithms for Min Max Correlation Clustering
ICML 2023
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
ICML 2022
Locally Fair Partitioning
AAAI 2022
Compressing Exact Cover Problems with Zero-suppressed Binary Decision Diagrams
IJCAI 2021
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
ICML 2021
An Algorithm for Multi-Attribute Diverse Matching
IJCAI 2020
Semi-bandit Optimization in the Dispersed Setting
UAI 2020
A Fast Algorithm for Generalized Arc Consistency of the Alldifferent Constraint
IJCAI 2018
Learning Determinantal Point Processes with Moments and Cycles
ICML 2017
Nonnegative Sparse PCA with Provable Guarantees
ICML 2014
MAP estimation in Binary MRFs via Bipartite Multi-cuts
NeurIPS 2010