conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

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

Papers

A Greedy Approach for Budgeted Maximum Inner Product Search NIPS 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NIPS 2017
A Screening Rule for l1-Regularized Ising Model Estimation NIPS 2017
Subset Selection and Summarization in Sequential Data NIPS 2017
Conic Scan-and-Cover algorithms for nonparametric topic modeling NIPS 2017
The Importance of Communities for Learning to Influence NIPS 2017
Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NIPS 2017
Decomposable Submodular Function Minimization: Discrete and Continuous NIPS 2017
Stochastic Submodular Maximization: The Case of Coverage Functions NIPS 2017
Linear regression without correspondence NIPS 2017
Minimizing a Submodular Function from Samples NIPS 2017
Predicting Organic Reaction Outcomes with Weisfeiler-Lehman Network NIPS 2017
Influence Maximization with $\varepsilon$-Almost Submodular Threshold Functions NIPS 2017
Clustering Stable Instances of Euclidean k-means. NIPS 2017
Subset Selection under Noise NIPS 2017
Learning Combinatorial Optimization Algorithms over Graphs NIPS 2017
Learning Chordal Markov Networks via Branch and Bound NIPS 2017
Approximation Algorithms for $\ell_0$-Low Rank Approximation NIPS 2017
Interactive Submodular Bandit NIPS 2017
Semantic Dependency Parsing via Book Embedding ACL 2017
Conditions beyond treewidth for tightness of higher-order LP relaxations AISTATS 2017
Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains AISTATS 2017
Scaling Submodular Maximization via Pruned Submodularity Graphs AISTATS 2017
Random Consensus Robust PCA AISTATS 2017
Combinatorial Topic Models using Small-Variance Asymptotics AISTATS 2017