Near-linear time approximation schemes for Steiner tree and forest in low-dimensional spaces.
Lee-Ad GottliebYair BartalPublished in: CoRR (2019)
Keyphrases
- approximation schemes
- steiner tree
- low dimensional spaces
- multi type
- approximation algorithms
- dimensionality reduction
- low dimensional
- high dimensional
- minimum spanning tree
- shortest path
- subspace clustering
- worst case
- metric space
- facility location
- latent space
- high dimensional spaces
- linear programming relaxation
- high dimensional data
- numerical methods
- np hard
- manifold learning
- graph theory
- neural network
- data objects
- generative model
- pattern recognition
- computer vision