A lower bound for the coverability problem in acyclic pushdown VAS.
Matthias EnglertPiotr HofmanSlawomir LasotaRanko LazicJérôme LerouxJuliusz StraszynskiPublished in: Inf. Process. Lett. (2021)
Keyphrases
- lower bound
- np hard
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- np complete
- worst case
- database schemes
- model checking
- lower and upper bounds
- scheduling problem
- lower bounding
- knapsack problem
- approximation algorithms
- upper and lower bounds
- linear programming
- objective function
- database
- constant factor
- polynomial approximation
- search space
- lagrangian relaxation
- online algorithms
- vc dimension
- decision problems
- branch and bound method
- neural network