Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth.
Bas A. M. van GeffenBart M. P. JansenArnoud A. W. M. de KroonRolf MorelPublished in: CoRR (2018)
Keyphrases
- planar graphs
- lower bound
- dynamic programming
- upper bound
- lagrangian relaxation
- branch and bound
- branch and bound algorithm
- np hard
- lower and upper bounds
- partition function
- approximate inference
- single machine
- upper and lower bounds
- knapsack problem
- objective function
- stereo matching
- greedy algorithm
- linear programming
- minimum weight
- worst case
- piecewise linear
- closed form
- linear programming relaxation
- binary variables
- optimal solution