approximation algorithm

Maximizing Nash Social Welfare under Two-Sided Preferences AAAI 2024 Metric Clustering and MST with Strong and Weak Distance Oracles COLT 2024 NN-Steiner: A Mixed Neural-Algorithmic Approach for the Rectilinear Steiner Minimum Tree Problem AAAI 2024 Non-monotone Sequential Submodular Maximization AAAI 2024 On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles AAAI 2024 One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficiently NeurIPS 2024 Online Learning of Partitions in Additively Separable Hedonic Games IJCAI 2024 On Optimal Tradeoffs between EFX and Nash Welfare AAAI 2024 On Socially Fair Low-Rank Approximation and Column Subset Selection NeurIPS 2024 On the cohesion and separability of average-link for hierarchical agglomerative clustering NeurIPS 2024 On the Pursuit of EFX for Chores: Non-existence and Approximations IJCAI 2024 Optimal Decision Tree and Adaptive Submodular Ranking with Noisy Outcomes JMLR 2024 Optimally Improving Cooperative Learning in a Social Setting ICML 2024 Optimisation and Approximation in Abstract Argumentation: The Case of Stable Semantics IJCAI 2024 Pandora’s Problem with Deadlines AAAI 2024 Parameterized Approximation Algorithms for Sum of Radii Clustering and Variants AAAI 2024 Parameterized Approximation Schemes for Fair-Range Clustering NeurIPS 2024 Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems ICML 2024 Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint NeurIPS 2024 Principal-Agent Reward Shaping in MDPs AAAI 2024 Promoting Counterfactual Robustness through Diversity AAAI 2024 Proportional Fairness in Clustering: A Social Choice Perspective NeurIPS 2024 Proportional Representation in Metric Spaces and Low-Distortion Committee Selection AAAI 2024 Public Event Scheduling with Busy Agents IJCAI 2024 Query-Efficient Correlation Clustering with Noisy Oracle NeurIPS 2024