Combinatorial Optimization

Measuring Mutual Information Between All Pairs of Variables in Subquadratic Complexity AISTATS 2020 MINA: Convex Mixed-Integer Programming for Non-Rigid Shape Alignment CVPR 2020 Minimax Bounds for Structured Prediction Based on Factor Graphs AISTATS 2020 Mining Topological Structure in Graphs through Forest Representations JMLR 2020 Modelling Diversity of Solutions AAAI 2020 Multi-Directional Heuristic Search IJCAI 2020 Multi-label Feature Selection via Global Relevance and Redundancy Optimization IJCAI 2020 Multi-Objective Multi-Agent Planning for Jointly Discovering and Tracking Mobile Objects AAAI 2020 Multiple Birds with One Stone: Beating 1/2 for EFX and GMMS via Envy Cycle Elimination AAAI 2020 Multi-Type Resource Allocation with Partial Preferences AAAI 2020 Myersonian Regression NeurIPS 2020 Neural Approximate Dynamic Programming for On-Demand Ride-Pooling AAAI 2020 Non-revisiting Coverage Task with Minimal Discontinuities for Non-redundant Manipulators RSS 2020 NuCDS: An Efficient Local Search Algorithm for Minimum Connected Dominating Set IJCAI 2020 ODSS: Efficient Hybridization for Optimal Coalition Structure Generation AAAI 2020 Online Influence Maximization under Linear Threshold Model NeurIPS 2020 On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness AISTATS 2020 On Robustness in Qualitative Constraint Networks IJCAI 2020 On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules IJCAI 2020 On the Enumeration of Association Rules: A Decomposition-based Approach IJCAI 2020 On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes ICML 2020 On the Max-Min Fair Stochastic Allocation of Indivisible Goods AAAI 2020 On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank AAAI 2020 On the Problem of Covering a 3-D Terrain AAAI 2020 On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness ICML 2020