Combinatorial Optimization

Making the Cut: A Bandit-based Approach to Tiered Interviewing NeurIPS 2019 Matching with Constraints IJCAI 2019 Matroid Constrained Fair Allocation Problem AAAI 2019 Matroids, Matchings, and Fairness AISTATS 2019 MaxHedge: Maximizing a Maximum Online AISTATS 2019 Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimization AAAI 2019 Merge-and-Shrink Task Reformulation for Classical Planning IJCAI 2019 Migration as Submodular Optimization AAAI 2019 Minimal Rewiring: Efficient Live Expansion for Clos Data Center Networks NSDI 2019 Minimizing Time-to-Rank: A Learning and Recommendation Approach IJCAI 2019 Minimum Intervention Cover of a Causal Graph AAAI 2019 Model-Based Diagnosis of Hybrid Systems Using Satisfiability Modulo Theory AAAI 2019 Multi-Agent Path Finding on Ozobots IJCAI 2019 Multivariate Submodular Optimization ICML 2019 Multi-Winner Contests for Strategic Diffusion in Social Networks AAAI 2019 muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking NeurIPS 2019 (Nearly) Efficient Algorithms for the Graph Matching Problem on Correlated Random Graphs NeurIPS 2019 Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs AISTATS 2019 Neural Decipherment via Minimum-Cost Flow: From Ugaritic to Linear B ACL 2019 Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity ICML 2019 Object Reachability via Swaps along a Line AAAI 2019 On Computational Complexity of Pickup-and-Delivery Problems with Precedence Constraints or Time Windows IJCAI 2019 On Differentially Private Graph Sparsification and Applications NeurIPS 2019 On Division Versus Saturation in Pseudo-Boolean Solving IJCAI 2019 On the Efficiency and Equilibria of Rich Ads IJCAI 2019