Combinatorial Optimization

Reparameterizing the Birkhoff Polytope for Variational Permutation Inference AISTATS 2018 ResQ: Enabling SLOs in Network Function Virtualization NSDI 2018 Revisiting Decomposable Submodular Function Minimization with Incidence Relations NeurIPS 2018 Robust Maximization of Non-Submodular Objectives AISTATS 2018 Safe Element Screening for Submodular Function Minimization ICML 2018 Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints ICML 2018 Scheduling under Uncertainty: A Query-based Approach IJCAI 2018 Search Progress and Potentially Expanded States in Greedy Best-First Search IJCAI 2018 Seeking Practical CDCL Insights from Theoretical SAT Benchmarks IJCAI 2018 Signal and Noise Statistics Oblivious Orthogonal Matching Pursuit ICML 2018 Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks IJCAI 2018 Simple, Robust and Optimal Ranking from Pairwise Comparisons JMLR 2018 Sketching Method for Large Scale Combinatorial Inference NeurIPS 2018 Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection IJCAI 2018 Solving M-Modes in Loopy Graphs Using Tree Decompositions PGM 2018 Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract) IJCAI 2018 Solving Partial Assignment Problems using Random Clique Complexes ICML 2018 Solving Patrolling Problems in the Internet Environment IJCAI 2018 Solving Sudoku with Consistency: A Visual and Interactive Approach IJCAI 2018 Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT IJCAI 2018 Stochastic Anytime Search for Bounding Marginal MAP IJCAI 2018 Stratification for Constraint-Based Multi-Objective Combinatorial Optimization IJCAI 2018 Structure From Recurrent Motion: From Rigidity to Recurrency CVPR 2018 Submodularity on Hypergraphs: From Sets to Sequences AISTATS 2018 Submodular Maximization via Gradient Ascent: The Case of Deep Submodular Functions NeurIPS 2018