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

The Power of Adaptivity for Stochastic Submodular Cover ICML 2021
Local Correlation Clustering with Asymmetric Classification Errors ICML 2021
Approximate Group Fairness for Clustering ICML 2021
Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning ICML 2021
Near-Optimal Algorithms for Explainable k-Medians and k-Means ICML 2021
Randomized Dimensionality Reduction for Facility Location and Single-Linkage Clustering ICML 2021
Hierarchical Clustering of Data Streams: Scalable Algorithms and Approximation Guarantees ICML 2021
Computing Quantal Stackelberg Equilibrium in Extensive-Form Games AAAI 2021
Towards Efficient Selection of Activity Trajectories based on Diversity and Coverage AAAI 2021
Fixed-Parameter and Approximation Algorithms for PCA with Outliers ICML 2021
Approximate Multiplication of Sparse Matrices with Limited Space AAAI 2021
On the PTAS for Maximin Shares in an Indivisible Mixed Manna AAAI 2021
Computational Analyses of the Electoral College: Campaigning Is Hard But Approximately Manageable AAAI 2021
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size AAAI 2021
Fuzzy Clustering with Similarity Queries NIPS 2021
A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering NIPS 2021
Cardinality constrained submodular maximization for random streams NIPS 2021
NN-Baker: A Neural-network Infused Algorithmic Framework for Optimization Problems on Geometric Intersection Graphs NIPS 2021
Approximation algorithm for submodular maximization under submodular cover UAI 2021
Consistent k-Median: Simpler, Better and Robust AISTATS 2021
Maximizing Agreements for Ranking, Clustering and Hierarchical Clustering via MAX-CUT AISTATS 2021
Large Scale K-Median Clustering for Stable Clustering Instances AISTATS 2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions AISTATS 2021
Locally Private k-Means in One Round ICML 2021
Robust Learning-Augmented Caching: An Experimental Study ICML 2021