← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Bipartite Correlation Clustering: Maximizing Agreements AISTATS 2016
Memory Efficient Max Flow for Multi-Label Submodular MRFs CVPR 2016
Pruning Random Forests for Prediction on a Budget NIPS 2016
Hierarchical Clustering via Spreading Metrics NIPS 2016
Trust No One: Low Rank Matrix Factorization Using Hierarchical RANSAC CVPR 2016
Efficient Globally Optimal 2D-To-3D Deformable Shape Matching CVPR 2016
Rounding-based Moves for Semi-Metric Labeling JMLR 2016
Optimal Tagging with Markov Chain Optimization NIPS 2016
The Power of Optimization from Samples NIPS 2016
Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization NIPS 2016
Maximization of Approximately Submodular Functions NIPS 2016
An Efficient Streaming Algorithm for the Submodular Cover Problem NIPS 2016
Learning Tree Structured Potential Games NIPS 2016
Video-Story Composition via Plot Analysis CVPR 2016
Distributed Submodular Maximization JMLR 2016
Improved Learning Complexity in Combinatorial Pure Exploration Bandits AISTATS 2016
Leveraging Sparsity for Efficient Submodular Data Summarization NIPS 2016
Fast Constrained Submodular Maximization: Personalized Data Summarization ICML 2016
Kinematic Structure Correspondences via Hypergraph Matching CVPR 2016
Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices JMLR 2016
Greedy Column Subset Selection: New Bounds and Distributed Algorithms ICML 2016
Linear Relaxations for Finding Diverse Elements in Metric Spaces NIPS 2016
Relaxation-Based Preprocessing Techniques for Markov Random Field Inference CVPR 2016
Fast Distributed Submodular Cover: Public-Private Data Summarization NIPS 2016
Learning Combinatorial Functions from Pairwise Comparisons COLT 2016