A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions

Abstract

Abstract. Fixed parameter tractable algorithms for bounded treewidth are known to exist for a wide class of graph optimization problems. While most research in this area has been focused on exact algorithms, it is hard to find decompositions of treewidth sufficiently small to make these algorithms fast enough for practical use. Consequently, tree decomposition based algorithms have limited applicability to large scale optimization. However, by first reducing the input graph so that a small width tree decomposition can be found, we can harness the power of tree decomposition based techniques in a heuristic algorithm, usable on graphs of much larger treewidth than would be tractable to solve exactly. We propose a solution merging heuristic to the Steiner Tree Problem that applies this idea. Standard local search heuristics provide a natural way to generate subgraphs with lower treewidth than the original instance, and subsequently we extract an improved solution by solving the instance induced by this subgraph. As such the fixed parameter tractable algorithm becomes an efficient tool for our solution merging heuristic. For a large class of sparse benchmark instances the algorithm is able to find small width tree decompositions on the union of generated solutions. Subsequently it can often improve on the generated solutions fast.

Strain-aware assembly of genomes from mixed samples using flow variation graphs

“…Since we do not know the composition of the quasispecies beforehand, we combine the results of all three heuristics into one set of candidate haplotypes for further optimization. Earlier work has shown that merging a pool of high quality approximations allows for efficient solutions to well-known optimization problems [43,44]. We compare performance of our combined approach and the individual greedy heuristics in the Supplementary Material.…”

Thuật toán tìm kiếm Hill climbing giải bài toán Cây Steiner nhỏ nhất

“…Ưu điểm của các thuật toán heuristic là thời gian chạy nhanh hơn nhiều so với các thuật toán metaheuristic. Giải pháp này thường được lựa chọn với các đồ thị có kích thước lớn [11,20,21,25].…”

A Variable Neighborhood Search Algorithm for Solving the Steiner Minimal Tree Problem in Sparse Graphs

“…Heuristic algorithms yield acceptable solutions, which might not be the best solution, in the permissible time. Optimal running time can be achieved with this class of algorithms [9,10,11].…”