https://openreview.net/forum?id=6vDYsXn0Dl
Linear Time Approximation Algorithm for Column Subset Selection with Local Search | OpenReview
The Column Subset Selection (CSS) problem has been widely studied in dimensionality reduction and feature selection. The goal of the CSS problem is to output a...
linear timeapproximation algorithm
https://arxiv.org/abs/1907.01228
[1907.01228] A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon
Abstract page for arXiv paper 1907.01228: A Constant-Factor Approximation Algorithm for Vertex Guarding a WV-Polygon
constant factorapproximation algorithm
https://arxiv.org/abs/1507.04227
[1507.04227] A bi-criteria approximation algorithm for $k$ Means
Abstract page for arXiv paper 1507.04227: A bi-criteria approximation algorithm for $k$ Means
a biapproximation algorithm150704227criteria
https://openreview.net/forum?id=wFuWSdCD7BN
A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering...
We give the first constant approximation algorithm for k-median clustering in the sequential no-substitution setting under a random arrival order.
https://arxiv.org/abs/1608.04112
[1608.04112] Optimal Polynomial-Time Estimators: A Bayesian Notion of Approximation Algorithm
Abstract page for arXiv paper 1608.04112: Optimal Polynomial-Time Estimators: A Bayesian Notion of Approximation Algorithm
polynomial time
https://www.mdpi.com/2073-8994/15/6/1207
A Three-Dimensional Subspace Algorithm Based on the Symmetry of the Approximation Model and WYL...
In this paper, a three-dimensional subspace method is proposed, in which the search direction is generated by minimizing the approximation model of the...