conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

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

Papers

Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence EMNLP 2017
Never Abandon Minorities: Exhaustive Extraction of Bursty Phrases on Microblogs Using Set Cover Problem EMNLP 2017
Near-Optimal Design of Experiments via Regret Minimization ICML 2017
Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms ICML 2017
Guarantees for Greedy Maximization of Non-submodular Functions with Applications ICML 2017
Robust Submodular Maximization: A Non-Uniform Partitioning Approach ICML 2017
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions ICML 2017
Robust Guarantees of Stochastic Greedy Algorithms ICML 2017
Analysis and Optimization of Graph Decompositions by Lifted Multicuts ICML 2017
On Approximation Guarantees for Greedy Low Rank Optimization ICML 2017
Exact MAP Inference by Avoiding Fractional Vertices ICML 2017
Dual Iterative Hard Thresholding: From Non-convex Sparse Minimization to Non-smooth Concave Maximization ICML 2017
Deletion-Robust Submodular Maximization: Data Summarization with “the Right to be Forgotten” ICML 2017
Differentially Private Submodular Maximization: Data Summarization in Disguise ICML 2017
Enumerating Distinct Decision Trees ICML 2017
Model-Independent Online Learning for Influence Maximization ICML 2017
On The Projection Operator to A Three-view Cardinality Constrained Set ICML 2017
Deep Learning at Alibaba IJCAI 2017
Voting by sequential elimination with few voters IJCAI 2017
Fair Division of a Graph IJCAI 2017
Pessimistic Leader-Follower Equilibria with Multiple Followers IJCAI 2017
Multiwinner Rules on Paths From k-Borda to Chamberlin–Courant IJCAI 2017
Operation Frames and Clubs in Kidney Exchange IJCAI 2017
Object Allocation via Swaps along a Social Network IJCAI 2017
Near-Feasible Stable Matchings with Budget Constraints IJCAI 2017