approximation algorithm

The Price of Justified Representation AAAI 2022 Traversing Supervisor Problem: An Approximately Optimal Approach to Multi-Robot Assistance RSS 2022 Two-Sided Weak Submodularity for Matroid Constrained Optimization and Regression COLT 2022 Undercover Boolean Matrix Factorization with MaxSAT AAAI 2022 Using Partial Monotonicity in Submodular Maximization NeurIPS 2022 Verification and search algorithms for causal DAGs NeurIPS 2022 Achieving Proportionality up to the Maximin Item with Indivisible Goods AAAI 2021 A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering NeurIPS 2021 Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021 Adaptivity in Adaptive Submodularity COLT 2021 Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings AAAI 2021 Approximate Group Fairness for Clustering ICML 2021 Approximate Multiplication of Sparse Matrices with Limited Space AAAI 2021 Approximation algorithm for submodular maximization under submodular cover UAI 2021 Approximation Algorithms for Orthogonal Non-negative Matrix Factorization AISTATS 2021 Approximation Algorithms for Socially Fair Clustering COLT 2021 Budget-feasible Maximum Nash Social Welfare is Almost Envy-free IJCAI 2021 Budget-feasible Mechanisms for Representing Groups of Agents Proportionally IJCAI 2021 Cardinality constrained submodular maximization for random streams NeurIPS 2021 Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021 Computing Quantal Stackelberg Equilibrium in Extensive-Form Games AAAI 2021 Consistent k-Median: Simpler, Better and Robust AISTATS 2021 Constrained Robust Submodular Partitioning NeurIPS 2021 Coresets for Decision Trees of Signals NeurIPS 2021 Defending against Contagious Attacks on a Network with Resource Reallocation AAAI 2021