Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets.
Shimon KoganMerav ParterPublished in: CoRR (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- objective function
- np hard
- upper and lower bounds
- lower bounding
- routing algorithm
- worst case
- overlay network
- linear programming relaxation
- online algorithms
- quadratic assignment problem
- running times
- optimal solution
- lagrangian relaxation
- max sat