Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound.
Hung LeLazar MilenkovicShay SolomonPublished in: SoCG (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound
- worst case
- branch and bound algorithm
- lower and upper bounds
- objective function
- upper and lower bounds
- np hard
- high dimensional
- euclidean distance
- sparse matrix
- sparse data
- euclidean space
- sparse coding
- optimal solution
- data sets
- sparse representation
- linear programming relaxation
- compressed sensing
- constant factor
- range queries
- average case
- vc dimension
- search space
- data structure
- neural network