approximation algorithm

Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits NeurIPS 2021 Reformulating DOVER-Lap Label Mapping as a Graph Partitioning Problem Interspeech 2021 Robust Learning-Augmented Caching: An Experimental Study ICML 2021 Stochastic Probing with Increasing Precision IJCAI 2021 Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity ICML 2021 Targeted Negative Campaigning: Complexity and Approximations AAAI 2021 The Power of Adaptivity for Stochastic Submodular Cover ICML 2021 Towards Efficient Selection of Activity Trajectories based on Diversity and Coverage AAAI 2021 Unexpected Effects of Online no-Substitution k-means Clustering ALT 2021 Adaptive Probing Policies for Shortest Path Routing NeurIPS 2020 Adversarial Blocking Bandits NeurIPS 2020 An Õ(m/ε^3.5)-Cost Algorithm for Semidefinite Programs with Diagonal Constraints COLT 2020 An Objective for Hierarchical Clustering in Euclidean Space and Its Connection to Bisecting K-means AAAI 2020 A Novel Approach for Constrained Optimization in Graphical Models NeurIPS 2020 Approximating bounded tree-width Bayesian network classifiers with OBDD PGM 2020 Approximation Schemes for ReLU Regression COLT 2020 Balancing Spreads of Influence in a Social Network AAAI 2020 Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection AISTATS 2020 “Bring Your Own Greedy”+Max: Near-Optimal 1/2-Approximations for Submodular Knapsack AISTATS 2020 Choice Set Optimization Under Discrete Choice Models of Group Decisions ICML 2020 Comparing Election Methods Where Each Voter Ranks Only Few Candidates AAAI 2020 Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues IJCAI 2020 Contiguous Cake Cutting: Hardness Results and Approximation Algorithms AAAI 2020 Continuous Submodular Maximization: Beyond DR-Submodularity NeurIPS 2020 Correlation Clustering with Asymmetric Classification Errors ICML 2020