Sparse Euclidean Spanners with Optimal Diameter: A General and Robust Lower Bound via a Concave Inverse-Ackermann Function.
Hung LeLazar MilenkovicShay SolomonPublished in: SoCG (2023)
Keyphrases
- lower bound
- piecewise linear
- optimal solution
- upper bound
- special case
- objective function
- np hard
- branch and bound algorithm
- neural network
- optimal cost
- branch and bound
- dynamic programming
- scheduling problem
- sufficiently accurate
- sparse data
- semi infinite programming
- constant factor
- competitive ratio
- computationally tractable
- lower and upper bounds
- similarity measure
- feature selection