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: J. Graph Algorithms Appl. (2020)
Keyphrases
- planar graphs
- lower bound
- dynamic programming
- lagrangian relaxation
- upper bound
- branch and bound algorithm
- branch and bound
- greedy algorithm
- worst case
- objective function
- partition function
- linear programming
- lower and upper bounds
- np hard
- knapsack problem
- upper and lower bounds
- optimal solution
- linear program
- stereo matching
- approximate inference
- minimum weight
- single machine
- probability distribution
- column generation