Pages that link to "Item:Q5432371"
From MaRDI portal
The following pages link to Approximating the Radii of Point Sets (Q5432371):
Displaying 10 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- Nearly optimal minimax estimator for high-dimensional sparse linear regression (Q385791) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Approximating the diameter of a set of points in the Euclidean space (Q1123610) (← links)
- Deterministic and randomized polynomial‐time approximation of radii (Q4435530) (← links)
- ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE (Q4513237) (← links)
- A Greedy Algorithm for Subspace Approximation Problem (Q5116494) (← links)
- (Q5743431) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900932) (← links)