approximation algorithm

Nearly Tight Bounds For Differentially Private Multiway Cut NeurIPS 2023 Near-Optimal k-Clustering in the Sliding Window Model NeurIPS 2023 Near-optimal Coresets for Robust Clustering ICLR 2023 New metrics and search algorithms for weighted causal DAGs ICML 2023 On Coresets for Clustering in Small Dimensional Euclidean spaces ICML 2023 Online Algorithms with Costly Predictions AISTATS 2023 On the Cost of Demographic Parity in Influence Maximization AAAI 2023 Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs ICML 2023 Optimal Scoring Rules for Multi-dimensional Effort COLT 2023 Optimizing Multiple Simultaneous Objectives for Voting and Facility Location AAAI 2023 Ordinal Maximin Share Approximation for Goods (Extended Abstract) IJCAI 2023 Practical Parallel Algorithms for Submodular Maximization Subject to a Knapsack Constraint with Nearly Optimal Adaptivity AAAI 2023 Rainbow Cycle Number and EFX Allocations: (Almost) Closing the Gap IJCAI 2023 Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations NeurIPS 2023 Reconstructing an Epidemic Outbreak Using Steiner Connectivity AAAI 2023 Replicable Clustering NeurIPS 2023 Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets AISTATS 2023 Scalable and Effective Conductance-Based Graph Clustering AAAI 2023 Scalable Bicriteria Algorithms for Non-Monotone Submodular Cover AISTATS 2023 Simple, Scalable and Effective Clustering via One-Dimensional Projections NeurIPS 2023 Simplification and Improvement of MMS Approximation IJCAI 2023 Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple! NeurIPS 2023 Size-constrained k-submodular maximization in near-linear time UAI 2023 Speeding Up Bellman Ford via Minimum Violation Permutations ICML 2023 Strategic Facility Location with Clients That Minimize Total Waiting Time AAAI 2023