conftrace_

approximation algorithm

630 papers

Explore in graph

Also known as

APPROX

Co-occurring keywords

combinatorial optimization (1039) submodular maximization (143) submodular optimization (261) k-means clustering (235) greedy algorithm (242) mechanism design (340) fair division (158) submodular function (121) hierarchical clustering (232) graph algorithm (178)

Papers

$k$-Means Clustering with Distance-Based Privacy NIPS 2023
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint IJCAI 2023
A Framework to Design Approximation Algorithms for Finding Diverse Solutions in Combinatorial Problems AAAI 2023
A Constant-Factor Approximation Algorithm for Reconciliation $k$-Median AISTATS 2023
Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers IJCAI 2023
Ordinal Maximin Share Approximation for Goods (Extended Abstract) IJCAI 2023
Diversity Maximization in the Presence of Outliers AAAI 2023
Multiagent MST Cover: Pleasing All Optimally via a Simple Voting Rule AAAI 2023
Approximations for Indivisible Concave Allocations with Applications to Nash Welfare Maximization AAAI 2023
Truthful Mechanisms for Steiner Tree Problems AAAI 2023
Fully Dynamic Submodular Maximization over Matroids ICML 2023
Dimensionality Reduction for General KDE Mode Finding ICML 2023
Near-Optimal $k$-Clustering in the Sliding Window Model NIPS 2023
Finding Safe Zones of Markov Decision Processes Policies NIPS 2023
Incentive-Compatible Selection for One or Two Influentials IJCAI 2023
Near-Linear Time Algorithm for the Chamfer Distance NIPS 2023
Multi-Swap k-Means++ NIPS 2023
Submodular Order Functions and Assortment Optimization ICML 2023
On Coresets for Clustering in Small Dimensional Euclidean spaces ICML 2023
Nearly Tight Bounds For Differentially Private Multiway Cut NIPS 2023
Triple Eagle: Simple, Fast and Practical Budget-Feasible Mechanisms NIPS 2023
Fast Combinatorial Algorithms for Min Max Correlation Clustering ICML 2023
Fast $(1+\varepsilon)$-Approximation Algorithms for Binary Matrix Factorization ICML 2023
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs ICML 2023
The Gain from Ordering in Online Learning NIPS 2023