← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Combinatorial Algorithms for Optimal Design COLT 2019
Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problem COLT 2019
Efficient Algorithms for Optimal Perimeter Guarding RSS 2019
A 2-Approximation Algorithm for the Online Tethered Coverage Problem RSS 2019
Feature subset selection for the multinomial logit model via mixed-integer optimization AISTATS 2019
Differentially Private Online Submodular Minimization AISTATS 2019
MaxHedge: Maximizing a Maximum Online AISTATS 2019
Matroids, Matchings, and Fairness AISTATS 2019
Sample Efficient Graph-Based Optimization with Noisy Observations AISTATS 2019
Batched Stochastic Bayesian Optimization via Combinatorial Constraints Design AISTATS 2019
Computation Efficient Coded Linear Transform 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
Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs AISTATS 2019
Approximation Hardness for A Class of Sparse Optimization Problems JMLR 2019
A Submodular Feature-Aware Framework for Label Subset Selection in Extreme Classification Problems NAACL 2019
Submodular Optimization-based Diverse Paraphrasing and its Effectiveness in Data Augmentation NAACL 2019
Distributed Weighted Matching via Randomized Composable Coresets ICML 2019
Dimensionality Reduction for Tukey Regression ICML 2019
Submodular Cost Submodular Cover with an Approximate Oracle ICML 2019
Robust Influence Maximization for Hyperparametric Models ICML 2019
Faster Algorithms for Binary Matrix Factorization ICML 2019
Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm ICML 2019
Hiring Under Uncertainty ICML 2019
Generalized Linear Rule Models ICML 2019