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

Linear Relaxations for Finding Diverse Elements in Metric Spaces NIPS 2016
Hierarchical Clustering via Spreading Metrics NIPS 2016
Algorithms for Optimizing the Ratio of Submodular Functions ICML 2016
The Power of Optimization from Samples NIPS 2016
Bipartite Correlation Clustering: Maximizing Agreements AISTATS 2016
The Multi-fidelity Multi-armed Bandit NIPS 2016
K-Means Clustering with Distributed Dimensions ICML 2016
Correlation Clustering and Biclustering with Locally Bounded Errors ICML 2016
Simple and Efficient Weighted Minwise Hashing NIPS 2016
A Bounded p-norm Approximation of Max-Convolution for Sub-Quadratic Bayesian Inference on Additive Factors JMLR 2016
On the Approximability of Sparse PCA COLT 2016
Approximating Sparse PCA from Incomplete Data NIPS 2015
Correlation Clustering in Data Streams ICML 2015
Correlation Clustering with Noisy Partial Information COLT 2015
Variable Selection is Hard COLT 2015
A PTAS for Agnostically Learning Halfspaces COLT 2015
Monotone k-Submodular Function Maximization with Size Constraints NIPS 2015
Fast Distributed k-Center Clustering with Outliers on Massive Data NIPS 2015
A Generalization of Submodular Cover via the Diminishing Return Property on the Integer Lattice NIPS 2015
Parallel Correlation Clustering on Big Graphs NIPS 2015
Distributed Balanced Clustering via Mapping Coresets NIPS 2014
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost ICML 2014
Concavity of reweighted Kikuchi approximation NIPS 2014
Parallel Double Greedy Submodular Maximization NIPS 2014
Rounding-based Moves for Metric Labeling NIPS 2014