Tree decompositions of graphs: Saving memory in dynamic programming

We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique" is closely related to a tree-like set covering problem.

• Type: Journal
• Year: 2006
• Where: DISOPT
• Authors: Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
• Keywords: DISOPT 2006, Dynamic Programming, Graph Optimization Problems, Tree Decompositions