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

Scheduling with Untrusted Predictions IJCAI 2022
The Complexity of Subelection Isomorphism Problems AAAI 2022
Secretary Matching with Vertex Arrivals and No Rejections AAAI 2022
Improved Coresets for Euclidean $k$-Means NIPS 2022
Submodular Maximization in Clean Linear Time NIPS 2022
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret NIPS 2022
Placing Green Bridges Optimally, with Habitats Inducing Cycles IJCAI 2022
Approximately EFX Allocations for Indivisible Chores IJCAI 2022
Strategyproof Mechanisms for Group-Fair Facility Location Problems IJCAI 2022
A Little Charity Guarantees Fair Connected Graph Partitioning AAAI 2022
Locally Private k-Means Clustering with Constant Multiplicative Approximation and Near-Optimal Additive Error AAAI 2022
Using Partial Monotonicity in Submodular Maximization NIPS 2022
Efficient and Stable Fully Dynamic Facility Location NIPS 2022
Coresets for Data Discretization and Sine Wave Fitting AISTATS 2022
Sketch-and-lift: scalable subsampled semidefinite program for K-means clustering AISTATS 2022
Undercover Boolean Matrix Factorization with MaxSAT AAAI 2022
Planning with Participation Constraints AAAI 2022
Achieving Proportionality up to the Maximin Item with Indivisible Goods AAAI 2021
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering ICML 2021
Objective-Based Hierarchical Clustering of Deep Embedding Vectors AAAI 2021
Near-Optimal Algorithms for Explainable k-Medians and k-Means ICML 2021
Differentially Private k-Means via Exponential Mechanism and Max Cover AAAI 2021
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021
Approximate Group Fairness for Clustering ICML 2021
Hierarchical Clustering via Sketches and Hierarchical Correlation Clustering AISTATS 2021