Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces.
Yair BartalLee-Ad GottliebPublished in: STOC (2021)
Keyphrases
- approximation schemes
- steiner tree
- low dimensional spaces
- multi type
- approximation algorithms
- dimensionality reduction
- low dimensional
- high dimensional
- minimum spanning tree
- subspace clustering
- worst case
- metric space
- facility location
- shortest path
- high dimensional spaces
- numerical methods
- bin packing
- high dimensional data
- latent space
- relational data
- upper bound
- computer vision
- distance function
- feature selection