Sparse Approximation via Generating Point Sets
From MaRDI portal
Publication:4972677
DOI10.1145/3302249zbMath1454.68154OpenAlexW2953276104MaRDI QIDQ4972677
Benjamin Raichel, Avrim L. Blum, Sariel Har-Peled
Publication date: 25 November 2019
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3302249
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (2)
Non-Negative Sparse Regression and Column Subset Selection with L1 Error ⋮ Sparse convex hull coverage
Cites Work
- Clustering to minimize the maximum intercluster distance
- \(\epsilon\)-nets and simplex range queries
- High-dimensional shape fitting in linear time
- Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem
- Approximating extent measures of points
- Sparse Approximation via Generating Point Sets
- Algorithms for polytope covering and approximation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Sparse Approximation via Generating Point Sets