conftrace_

approximation guarantee

65 papers

Explore in graph

Co-occurring keywords

greedy algorithm (242) submodular maximization (143) approximation algorithm (630) submodular optimization (261) cardinality constraint (71) combinatorial optimization (1039) streaming algorithm (131) evolutionary algorithm (264) data summarization (37) k-means clustering (235)

Papers

Scalable Solutions to Zero-Sum Partially Observable Stochastic Games Through Belief Aggregation with Approximation Guarantees AAAI 2026
Algorithms for Context Engineering in LLM Inference: Optimization of Placement, Compression, and Scheduling AAAI 2026
The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III) IJCAI 2025
Online and Streaming Algorithms for Constrained k-Submodular Maximization AAAI 2025
Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II IJCAI 2025
Mechanism design augmented with output advice NIPS 2024
Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints IJCAI 2024
Learning-Augmented Dynamic Submodular Maximization NIPS 2024
Submodular Order Functions and Assortment Optimization ICML 2023
Active Learning for Single Neuron Models with Lipschitz Non-Linearities AISTATS 2023
Optimization of Inter-group criteria for clustering with minimum size constraints NIPS 2023
Composable Coresets for Determinant Maximization: Greedy is Almost Optimal NIPS 2023
Path following algorithms for $\ell_2$-regularized $M$-estimation with approximation guarantee NIPS 2023
Agnostic Learnability of Halfspaces via Logistic Loss ICML 2022
Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem AAAI 2022
Heterogeneous Facility Location with Limited Resources AAAI 2022
Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+Optimize NIPS 2022
On the Approximation of Cooperative Heterogeneous Multi-Agent Reinforcement Learning (MARL) using Mean Field Control (MFC) JMLR 2022
Fast Pareto Optimization for Subset Selection with Dynamic Cost Constraints IJCAI 2021
Submodular + Concave NIPS 2021
Differentially Private Densest Subgraph Detection ICML 2021
Instance Specific Approximations for Submodular Maximization ICML 2021
Greedy Approximation Algorithms for Active Sequential Hypothesis Testing NIPS 2021
The FAST Algorithm for Submodular Maximization ICML 2020
Universal Simulation of Stable Dynamical Systems by Recurrent Neural Nets L4DC 2020