approximation algorithm

Correlation Robust Influence Maximization NeurIPS 2020 Defending with Shared Resources on a Network AAAI 2020 Dependent randomized rounding for clustering and partition systems with knapsack constraints AISTATS 2020 Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time NeurIPS 2020 Differentially Private Clustering: Tight Approximation Ratios NeurIPS 2020 Dynamic Submodular Maximization NeurIPS 2020 Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability AAAI 2020 Explainable k-Means and k-Medians Clustering ICML 2020 Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives AAAI 2020 Fair Correlation Clustering AISTATS 2020 Fair Division: The Computer Scientist’s Perspective IJCAI 2020 Fair k-Centers via Maximum Matching ICML 2020 Fairness in Streaming Submodular Maximization: Algorithms and Hardness NeurIPS 2020 Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NeurIPS 2020 Fast and Private Submodular and k-Submodular Functions Maximization with Matroid Constraints ICML 2020 Fast Noise Removal for k-Means Clustering AISTATS 2020 From Trees to Continuous Embeddings and Back: Hyperbolic Hierarchical Clustering NeurIPS 2020 Gradient Method for Continuous Influence Maximization with Budget-Saving Considerations AAAI 2020 Guarantees of Stochastic Greedy Algorithms for Non-monotone Submodular Maximization with Cardinality Constraint AISTATS 2020 Hierarchical Clustering: A 0.585 Revenue Approximation COLT 2020 High Dimensional Discrete Integration over the Hypergrid UAI 2020 Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics NeurIPS 2020 How to Solve Fair k-Center in Massive Data Models ICML 2020 Improved Guarantees for k-means++ and k-means++ Parallel NeurIPS 2020 KFC: A Scalable Approximation Algorithm for k−center Fair Clustering NeurIPS 2020