← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

The Importance of Communities for Learning to Influence NIPS 2017
Approximation Algorithms for $\ell_0$-Low Rank Approximation NIPS 2017
Predicting Organic Reaction Outcomes with Weisfeiler-Lehman Network NIPS 2017
Minimizing a Submodular Function from Samples NIPS 2017
Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NIPS 2017
Never Abandon Minorities: Exhaustive Extraction of Bursty Phrases on Microblogs Using Set Cover Problem EMNLP 2017
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence EMNLP 2017
Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks JMLR 2017
Online Graph Completion: Multivariate Signal Recovery in Computer Vision CVPR 2017
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems CVPR 2017
A Greedy Approach for Budgeted Maximum Inner Product Search NIPS 2017
Influence Maximization with $\varepsilon$-Almost Submodular Threshold Functions NIPS 2017
Decomposable Submodular Function Minimization: Discrete and Continuous NIPS 2017
Macro Grammars and Holistic Triggering for Efficient Semantic Parsing EMNLP 2017
The limits of automatic summarisation according to ROUGE EACL 2017
Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NIPS 2017
Learning Combinatorial Optimization Algorithms over Graphs NIPS 2017
Enumeration of Extractive Oracle Summaries EACL 2017
Binary Constraint Preserving Graph Matching CVPR 2017
Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques JMLR 2017
On The Projection Operator to A Three-view Cardinality Constrained Set ICML 2017
Model-Independent Online Learning for Influence Maximization ICML 2017
Enumerating Distinct Decision Trees ICML 2017
Differentially Private Submodular Maximization: Data Summarization in Disguise ICML 2017
Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization ICML 2017