Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets.
Shimon KoganMerav ParterPublished in: FOCS (2022)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- objective function
- np hard
- optimal solution
- lower bounding
- quadratic assignment problem
- linear programming relaxation
- upper and lower bounds
- running times
- randomly generated problems
- vc dimension
- max sat
- coming years
- polynomial approximation
- sample complexity
- concept class
- neural network
- routing algorithm
- computational complexity
- learning algorithm
- genetic algorithm