A Greedy Algorithm for Subspace Approximation Problem

DOI10.4230/LIPICS.SWAT.2018.30zbMATH Open1477.68494OpenAlexW2806431894MaRDI QIDQ5116494FDOQ5116494

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

• Sampling algorithms for l₂ regression and applications
• Sampling Algorithms and Coresets for $\ell_p$ Regression
• On maximization of quadratic form over intersection of ellipsoids with common center
• Approximating the Radii of Point Sets
• Subgradient and sampling algorithms for \(\ell_1\) regression
• Title not available (Why is that?)
• The UGC Hardness Threshold of the L_p Grothendieck Problem
• Bypassing UGC from Some Optimal Geometric Inapproximability Results

Cited In (1)

• Speeding up the GVW algorithm via a substituting method

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116494)