Approximating the Radii of Point Sets

DOI10.1137/050627472zbMath1135.68055OpenAlexW2152299057MaRDI QIDQ5432371

No author found.

Publication date: 3 January 2008

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050627472

zbMATH Keywords

semidefinite programmingapproximation algorithmscomputational convexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (6)

Fixed-parameter tractability and lower bounds for stabbing problems ⋮ Nearly optimal minimax estimator for high-dimensional sparse linear regression ⋮ Efficient subspace approximation algorithms ⋮ Fast subspace approximation via greedy least-squares ⋮ A Greedy Algorithm for Subspace Approximation Problem ⋮ Unnamed Item

This page was built for publication: Approximating the Radii of Point Sets