approximation algorithm

Differentially Private Densest Subgraph Detection ICML 2021 Differentially Private k-Means via Exponential Mechanism and Max Cover AAAI 2021 Dynamic influence maximization NeurIPS 2021 Efficient Truthful Scheduling and Resource Allocation through Monitoring AAAI 2021 Enhancing Balanced Graph Edge Partition with Effective Local Search AAAI 2021 Equitable Scheduling on a Single Machine AAAI 2021 Extreme k-Center Clustering AAAI 2021 Fair Clustering Under a Bounded Cost NeurIPS 2021 Fairness in Influence Maximization through Randomization AAAI 2021 Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints AAAI 2021 Fair Scheduling for Time-dependent Resources NeurIPS 2021 Fixed-Parameter and Approximation Algorithms for PCA with Outliers ICML 2021 Forming Better Stable Solutions in Group Formation Games Inspired by Internet Exchange Points (IXPs) AAAI 2021 Fuzzy Clustering with Similarity Queries NeurIPS 2021 Greedy Approximation Algorithms for Active Sequential Hypothesis Testing NeurIPS 2021 Guaranteeing Maximin Shares: Some Agents Left Behind IJCAI 2021 Hierarchical Clustering: $O(1)$-Approximation for Well-Clustered Graphs NeurIPS 2021 Hierarchical Clustering of Data Streams: Scalable Algorithms and Approximation Guarantees ICML 2021 Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering AISTATS 2021 Improved Coresets and Sublinear Algorithms for Power Means in Euclidean Spaces NeurIPS 2021 Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NeurIPS 2021 Improving approximate optimal transport distances using quantization UAI 2021 Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization AAAI 2021 Intervention Efficient Algorithms for Approximate Learning of Causal Graphs ALT 2021 Large Scale K-Median Clustering for Stable Clustering Instances AISTATS 2021