Sparse Euclidean Spanners with Tiny Diameter: A Tight Lower Bound.
Hung LeLazar MilenkovicShay SolomonPublished in: CoRR (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- branch and bound
- optimal solution
- worst case
- sparse representation
- objective function
- sparse data
- euclidean distance
- lower bounding
- upper and lower bounds
- constant factor
- sample complexity
- vc dimension
- data sets
- compressive sensing
- multiscale
- sufficiently accurate
- euclidean metric
- competitive ratio
- compressed sensing
- sparse coding
- dynamic programming
- high dimensional