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: IPEC (2018)
Keyphrases
- planar graphs
- lower bound
- dynamic programming
- upper bound
- lagrangian relaxation
- partition function
- branch and bound algorithm
- np hard
- objective function
- linear programming
- branch and bound
- lower and upper bounds
- greedy algorithm
- upper and lower bounds
- minimum weight
- stereo matching
- sample complexity
- linear programming relaxation
- worst case
- belief propagation
- single machine
- piecewise linear
- training set