Tree decompositions of graphs: Saving memory in dynamic programming

14 years 4 months ago

Download theinf1.informatik.uni-jena.de

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.

Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann

Real-time Traffic

DISOPT 2006 | Dynamic Programming | Graph Optimization Problems | Tree Decompositions |

claim paper

» Static array storage optimization in MATLAB

» Dynamic voltage and frequency scaling based on workload decomposition

» The ParallelSequential Duality Matrices and Graphs

» Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes

» Decomposition During Search for PropagationBased Constraint Solvers

» Predicting Lifetimes in Dynamically Allocated Memory

» Genetic Network Programming with Reinforcement Learning and Its Performance Evaluation

» Using PRAM Algorithms on a UniformMemoryAccess SharedMemory Architecture

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	DISOPT
Authors	Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann

Comments (0)

Sciweavers

Tree decompositions of graphs: Saving memory in dynamic programming

DISOPT 2006 | Dynamic Programming | Graph Optimization Problems | Tree Decompositions |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers