conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

2
20
67
270
149
'05
'10
'15
'20
'25

Papers

Differentially Private Online Submodular Minimization AISTATS 2019
MaxHedge: Maximizing a Maximum Online AISTATS 2019
Matroids, Matchings, and Fairness AISTATS 2019
A Memoization Framework for Scaling Submodular Optimization to Large Scale Problems AISTATS 2019
Structured Robust Submodular Maximization: Offline and Online Algorithms AISTATS 2019
Sample Efficient Graph-Based Optimization with Noisy Observations AISTATS 2019
Batched Stochastic Bayesian Optimization via Combinatorial Constraints Design AISTATS 2019
Adaptive Exact Learning of Decision Trees from Membership Queries ALT 2019
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm COLT 2019
Lower Bounds for Parallel and Randomized Convex Optimization COLT 2019
Combinatorial Algorithms for Optimal Design COLT 2019
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019
Combinatorial Persistency Criteria for Multicut and Max-Cut CVPR 2019
A Decomposition Algorithm for the Sparse Generalized Eigenvalue Problem CVPR 2019
Fitting Multiple Heterogeneous Models by Multi-Class Cascaded T-Linkage CVPR 2019
A Convex Relaxation for Multi-Graph Matching CVPR 2019
End-To-End Efficient Representation Learning via Cascading Combinatorial Optimization CVPR 2019
Constraint-based Learning of Phonological Processes EMNLP 2019
Learning to Order Graph Elements with Application to Multilingual Surface Realization EMNLP 2019
Progressive-X: Efficient, Anytime, Multi-Model Fitting Algorithm ICCV 2019
HiPPI: Higher-Order Projected Power Iterations for Scalable Multi-Matching ICCV 2019
Distributed Weighted Matching via Randomized Composable Coresets ICML 2019
Scalable Fair Clustering ICML 2019
Dimensionality Reduction for Tukey Regression ICML 2019
Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019