Tree decompositions of graphs: Saving memory in dynamic programming

Authors:
Nadja Betzler;Rolf Niedermeier;Johannes Uhlmann
Affiliations:
Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076Tübingen, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany;Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 13, D-72076Tübingen, Germany
Venue:
Discrete Optimization
Year:
2006

Citing 17
Cited 2

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth

Theoretical Computer Science
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Dominating sets in planar graphs: branch-width and exponential speed-up

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Treewidth: Algorithmoc Techniques and Results

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems

WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
A Framework for Network Reliability Problems on Graphs of Bounded Treewidth

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Tree Decomposition Based Algorithms for Domination-like Problems

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes

CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
A Tree-Decomposition Approach to Protein Structure Prediction

CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Exact algorithms and applications for Tree-like Weighted Set Cover

Journal of Discrete Algorithms
Tree decompositions with small cost

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Discovering treewidth

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Improved algorithms and complexity results for power domination in graphs

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory

Graph minors and parameterized algorithm design

The Multivariate Algorithmic Revolution and Beyond
Complexity of finding maximum regular induced subgraphs with prescribed degree

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a simple and effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced ''anchor technique'' is based on a tree-like set covering problem. We substantiate our findings by experimental results. Our strategy has negligible computational overhead concerning running time but achieves memory savings for nice tree decompositions and path decompositions between 60% and 98%.