Combinatorial Optimization

Nearly Linear-Time, Parallelizable Algorithms for Non-Monotone Submodular Maximization AAAI 2021 Near-Optimal Algorithms for Explainable k-Medians and k-Means ICML 2021 Near Optimal Distributed Learning of Halfspaces with Two Parties COLT 2021 Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021 Neural Learning of One-of-Many Solutions for Combinatorial Problems in Structured Output Spaces ICLR 2021 New Algorithms for Japanese Residency Matching IJCAI 2021 New Length Dependent Algorithm for Maximum Satisfiability Problem AAAI 2021 NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs NeurIPS 2021 NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem AAAI 2021 On Continuous Local BDD-Based Search for Hybrid SAT Solving AAAI 2021 Oneshot Differentially Private Top-k Selection ICML 2021 One-sided Frank-Wolfe algorithms for saddle problems ICML 2021 On Fair Division under Heterogeneous Matroid Constraints AAAI 2021 On Finding the K-best Non-projective Dependency Trees ACL 2021 Online Learning of Facility Locations ALT 2021 On Minimizing the Number of Running Buffers for Tabletop Rearrangement RSS 2021 On the Complexity of Sum-of-Products Problems over Semirings AAAI 2021 On the Convex Combination of Determinantal Point Processes ACML 2021 On the Parameterized Complexity of Polytree Learning IJCAI 2021 On the PTAS for Maximin Shares in an Indivisible Mixed Manna AAAI 2021 On The Structure of Parametric Tournaments with Application to Ranking from Pairwise Comparisons NeurIPS 2021 Optimal Algorithms for Submodular Maximization with Distributed Constraints L4DC 2021 Optimal Counterfactual Explanations in Tree Ensembles ICML 2021 Optimal Kidney Exchange with Immunosuppressants AAAI 2021 Optimal Quantization Using Scaled Codebook CVPR 2021