Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies.
Johannes BlumSabine StorandtPublished in: ESA (2020)
Keyphrases
- approximation algorithms
- lower bound
- np hard
- search space
- worst case
- branch and bound
- optimal solution
- upper bound
- constant factor
- branch and bound algorithm
- special case
- set cover
- minimum cost
- objective function
- facility location problem
- scheduling problem
- np hardness
- vertex cover
- search algorithm
- constraint satisfaction problems
- approximation ratio
- randomized algorithms
- integer programming
- lower and upper bounds
- exact algorithms
- network design problem
- integrality gap
- approximation schemes
- greedy algorithm
- linear programming
- knapsack problem
- precedence constraints
- lagrangian relaxation
- solution space
- metaheuristic
- primal dual
- strongly np hard
- disjoint paths
- linear programming relaxation
- polynomial time approximation
- column generation
- error bounds
- linear program
- vc dimension
- computational complexity