A heuristic use of dynamic programming to upperbound treewidth.
Hisao TamakiPublished in: CoRR (2019)
Keyphrases
- dynamic programming
- upper bound
- dynamic programming algorithms
- state space
- lagrangian relaxation
- greedy algorithm
- stereo matching
- knapsack problem
- search space
- bounded treewidth
- markov decision processes
- lower bound
- boolean functions
- search algorithm
- locally optimal
- greedy search
- infinite horizon
- single machine
- linear programming
- column generation
- space complexity
- multiscale
- simulated annealing