New Additive Spanner Lower Bounds by an Unlayered Obstacle Product.
Greg BodwinGary HoppenworthPublished in: CoRR (2022)
Keyphrases
- lower bound
- upper bound
- mobile robot
- objective function
- np hard
- lower and upper bounds
- branch and bound algorithm
- branch and bound
- life cycle
- optimal cost
- upper and lower bounds
- worst case
- scheduling problem
- quadratic assignment problem
- search engine
- image registration
- production planning
- search algorithm
- linear programming relaxation
- product information
- e learning