INDDGO: Integrated Network Decomposition & Dynamic programming for Graph Optimization

Technical Report · Mon Oct 01 04:00:00 EDT 2012

DOI:https://doi.org/10.2172/1055043· OSTI ID:1055043

Groer, Christopher S ^[1]; Sullivan, Blair D ^[1]; Weerapurage, Dinesh P ^[1]

---

1. ORNL

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \emph{NP}-hard problems on graphs where the complexity is polynomial in the number of nodes and edges in the graph, but exponential in the width of the underlying tree decomposition. However, there has been relatively little computational work done to determine the practical utility of such dynamic programming algorithms. We have developed software to construct tree decompositions using various heuristics and have created a fast, memory-efficient dynamic programming implementation for solving maximum weighted independent set. We describe our software and the algorithms we have implemented, focusing on memory saving techniques for the dynamic programming. We compare the running time and memory usage of our implementation with other techniques for solving maximum weighted independent set, including a commercial integer programming solver and a semi-definite programming solver. Our results indicate that it is possible to solve some instances where the underlying decomposition has width much larger than suggested by the literature. For certain types of problems, our dynamic programming code runs several times faster than these other methods.

• Research Organization: Oak Ridge National Laboratory (ORNL); Center for Computational Sciences
• Sponsoring Organization: SC USDOE - Office of Science (SC)
• DOE Contract Number: AC05-00OR22725
• OSTI ID: 1055043
• Report Number(s): ORNL/TM-2012/176; KJ0401000; ERKJU04
• Country of Publication: United States
• Language: English