Combinatorial Optimization

Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence EMNLP 2017 Efficient Equilibrium Testing under Adhesion and Anisotropy using Empirical Contact Force Models RSS 2017 Efficient Inference for Untied MLNs IJCAI 2017 Efficient Mechanism Design for Online Scheduling (Extended Abstract) IJCAI 2017 Efficient Rank Aggregation via Lehmer Codes AISTATS 2017 Efficient Techniques for Crowdsourced Top-k Lists IJCAI 2017 Efficient Weighted Model Integration via SMT-Based Predicate Abstraction IJCAI 2017 Elementary Symmetric Polynomials for Optimal Experimental Design NeurIPS 2017 Enumerating Distinct Decision Trees ICML 2017 Enumeration of Extractive Oracle Summaries EACL 2017 Exact MAP Inference by Avoiding Fractional Vertices ICML 2017 Fair Allocation based on Diminishing Differences IJCAI 2017 Fair Division of a Graph IJCAI 2017 Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set EMNLP 2017 Finding Robust Solutions to Stable Marriage IJCAI 2017 Graph Verification with a Betweenness Oracle ALT 2017 Greed Is Good: Near-Optimal Submodular Maximization via Greedy Optimization COLT 2017 Guaranteed Non-convex Optimization: Submodular Maximization over Continuous Domains AISTATS 2017 Guarantees for Greedy Maximization of Non-submodular Functions with Applications ICML 2017 Hierarchical Clustering via Spreading Metrics JMLR 2017 Hierarchical Task Network Planning with Task Insertion and State Constraints IJCAI 2017 Improving Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms and Its Applications NeurIPS 2017 Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms ICML 2017 Influence Maximization with ε-Almost Submodular Threshold Functions NeurIPS 2017 Initialization and Coordinate Optimization for Multi-way Matching AISTATS 2017