Anytime Best+Depth-First Search for Bounding Marginal MAP.

Radu Marinescu Junkyu Lee Alexander T. Ihler Rina Dechter

Published in: AAAI (2017)

Keyphrases

dynamic programming
depth first search
depth first branch and bound
breadth first search
search tree
upper bound
routing problem
branch and bound
optimal solution
spanning tree
tree search
special case
nearest neighbor
knapsack problem