A Greedy Algorithm for Subspace Approximation Problem

DOI10.4230/LIPIcs.SWAT.2018.30zbMath1477.68494OpenAlexW2806431894MaRDI QIDQ5116494

Nguyen Kim Thang

Publication date: 25 August 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/swat/swat2018.html#Thang18

zbMATH Keywords

approximation algorithmssubspace approximation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• On maximization of quadratic form over intersection of ellipsoids with common center
• The UGC Hardness Threshold of the L_p Grothendieck Problem
• Sampling algorithms for l₂ regression and applications
• Sampling Algorithms and Coresets for $\ell_p$ Regression
• Bypassing UGC from Some Optimal Geometric Inapproximability Results
• Approximating the Radii of Point Sets

This page was built for publication: A Greedy Algorithm for Subspace Approximation Problem