Combinatorial Optimization

Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection JMLR 2018 Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection IJCAI 2018 A Reactive Strategy for High-Level Consistency During Search IJCAI 2018 ASAP: Fast, Approximate Graph Pattern Mining at Scale OSDI 2018 A Scalable Scheme for Counting Linear Extensions IJCAI 2018 A Structural Approach to Activity Selection IJCAI 2018 Bayesian Optimization of Combinatorial Structures ICML 2018 Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams ICML 2018 Big City vs. the Great Outdoors: Voter Distribution and How It Affects Gerrymandering IJCAI 2018 Boolean Decision Rules via Column Generation NeurIPS 2018 Boosting Combinatorial Problem Modeling with Machine Learning IJCAI 2018 Boosting Dynamic Programming with Neural Networks for Solving NP-hard Problems ACML 2018 Boosting MCSes Enumeration IJCAI 2018 Bringing Multi-agent Path Finding Closer to Reality IJCAI 2018 Budget-feasible Procurement Mechanisms in Two-sided Markets IJCAI 2018 Ceteris paribus majority for social ranking IJCAI 2018 Classification Transfer for Qualitative Reasoning Problems IJCAI 2018 Combinatorial Auctions via Machine Learning-based Preference Elicitation IJCAI 2018 Combinatorial Cost Sharing IJCAI 2018 Combinatorial Optimization with Graph Convolutional Networks and Guided Tree Search NeurIPS 2018 Combinatorial Penalties: Which structures are preserved by convex relaxations? AISTATS 2018 Combinatorial Preconditioners for Proximal Algorithms on Graphs AISTATS 2018 Combinatorial Pure Exploration with Continuous and Separable Reward Functions and Its Applications IJCAI 2018 Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets IJCAI 2018 Compiling Combinatorial Prediction Games ICML 2018