scientific article; zbMATH DE number 6783410

zbMath1374.68657MaRDI QIDQ5365058

Nisheeth K. Vishnoi, Amit Deshpande, Madhur Tulsiani

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133075

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ Unnamed Item ⋮ Impossibility of dimension reduction in the nuclear norm ⋮ Fast subspace approximation via greedy least-squares ⋮ On Approximating Matrix Norms in Data Streams ⋮ A Greedy Algorithm for Subspace Approximation Problem ⋮ Unnamed Item