Skip to content
conftrace_

Approximation Algorithms

162 papers

1
9
11
20
'10
'15
'20
'25

Papers

Approximation Algorithms for Observer Aware MDPs UAI 2024 Approximation Algorithms for Preference Aggregation Using CP-Nets AAAI 2024 Approximation Scheme for Weighted Metric Clustering via Sherali-Adams AAAI 2024 Efficient Centroid-Linkage Clustering NeurIPS 2024 Efficient Constrained K-center Clustering with Background Knowledge AAAI 2024 Efficiently Computing Similarities to Private Datasets ICLR 2024 Faster Approximation of Probabilistic and Distributional Values via Least Squares ICLR 2024 Learning-Augmented Approximation Algorithms for Maximum Cut and Related Problems NeurIPS 2024 Limits of Approximating the Median Treatment Effect COLT 2024 Metric Clustering and MST with Strong and Weak Distance Oracles COLT 2024 On Socially Fair Low-Rank Approximation and Column Subset Selection NeurIPS 2024 On the Capacitated Facility Location Problem with Scarce Resources UAI 2024 Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants AAAI 2024 Parameterized Approximation Schemes for Fair-Range Clustering NeurIPS 2024 Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint NeurIPS 2024 Public Event Scheduling with Busy Agents IJCAI 2024 Randomized Strategic Facility Location with Predictions NeurIPS 2024 SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI 2024 A Faster Practical Approximation Scheme for the Permanent AAAI 2023 A Learnable Radial Basis Positional Embedding for Coordinate-MLPs AAAI 2023 An Improved Approximation Algorithm for Wage Determination and Online Task Allocation in Crowd-Sourcing AAAI 2023 Approximation Algorithms for Fair Range Clustering ICML 2023 Composable Coresets for Determinant Maximization: Greedy is Almost Optimal NeurIPS 2023 Fair, Polylog-Approximate Low-Cost Hierarchical Clustering NeurIPS 2023 Multi-Stage Facility Location Problems with Transient Agents AAAI 2023