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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Bodlaender, H.L., Koster, A.M.C.A.: Treewidth computations I. Upper bounds, Information and Computation 208, 259–275 (2010)
Bodlaender, H.L., Fomin, F.V., Kratsch, D., Koster, A.M.C.A., Thilikos, D.M.: On exact algorithms for treewidth. ACM Trans. Algor. 9(1), 12 (2012)
Cook, W., Seymour, P.: Tour merging via branch-decomposition. INFORMS Journal on Computing 15(3), 233–248 (2003)
Fafianie, S., Bodlaender, H.L., Nederlof, J.: Speeding Up Dynamic Programming with Representative Sets. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 321–334. Springer, Heidelberg (2013)
Koch, T., Martin, A., Voß, S.: Steinlib, an updated library on Steiner tree problems in graphs. Technical Report ZIB-Report 00–37, Konrad-Zuse Zentrum fur Informationstechnik Berlin (2000). http://steinlib.zib.de/
Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing 14(3), 228–246 (2002)
Uchoa, E., de Aragao, M.P., Werneck, R., Ribeiro, C.C.: Bossa (2002). http://www.cs.princeton.edu/rwerneck/bossa/
Polzin, T.: Algorithms for the Steiner problem in Networks. Ph.d. Thesis, Universität des Saarlandes (2003)
Pajor, T., Uchoa, E., Werneck, R.F.: A Robust and Scalable Algorithm for the Steiner Problem in Graphs arXiv preprint (2014). arXiv:1412.2787
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Bosman, T. (2015). A Solution Merging Heuristic for the Steiner Problem in Graphs Using Tree Decompositions. In: Bampis, E. (eds) Experimental Algorithms. SEA 2015. Lecture Notes in Computer Science(), vol 9125. Springer, Cham. https://doi.org/10.1007/978-3-319-20086-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-20086-6_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20085-9
Online ISBN: 978-3-319-20086-6
eBook Packages: Computer ScienceComputer Science (R0)