Pages that link to "Item:Q2638782"
From MaRDI portal
The following pages link to On the complexity of some geometric problems in unbounded dimension (Q2638782):
Displayed 17 items.
- Fixed-parameter tractability and lower bounds for stabbing problems (Q359746) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- On the reverse Loomis-Whitney inequality (Q724946) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- On the complexity of some basic problems in computational convexity. I. Containment problems (Q1344616) (← links)
- Learning mixtures of separated nonspherical Gaussians (Q1774210) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- COMPUTING <i>k</i> CENTERS OVER STREAMING DATA FOR SMALL <i>k</i> (Q2939917) (← links)
- THE ALIGNED K-CENTER PROBLEM (Q2999091) (← links)
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (Q3012849) (← links)
- Some Discrete Properties of the Space of Line Transversals to Disjoint Balls (Q5188768) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces (Q6103169) (← links)
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)