A Linear Time Algorithm for the Minimum Spanning Caterpillar Problem for Bounded Treewidth Graphs
We consider the Minimum Spanning Caterpillar Problem (MSCP) in a graph where each edge has two costs, spine (path) cost and leaf cost, depending on whether it is used as a spine or a leaf edge. The goal is to find a spanning caterpillar in which the sum of its edge costs is the minimum. We show that the problem has a linear time algorithm when a tree decomposition of the graph is given as part of the input. Despite the fast growing constant factor of the time complexity of our algorithm, it is still practical and efficient for some classes of graphs, such as outerplanar, series-parallel (K 4 minor-free), and Halin graphs. We also briefly explain how one can modify our algorithm to solve the Minimum Spanning Ring Star and the Dual Cost Minimum Spanning Tree Problems.
Keywordsspanning caterpillars treewidth networks topology optimization
Unable to display preview. Download preview PDF.
- 4.Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 193–242. Elsevier, Amsterdam (1990)Google Scholar
- 5.Dinneen, M.J.: Practical enumeration methods for graphs of bounded pathwidth and treewidth. Technical Report CDMTCS–055, Center for Discrete Mathematics and Theoretical Computer Science, Auckland (1997)Google Scholar
- 6.Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)Google Scholar
- 10.Simonetti, L., Frota, Y., de Souza, C.C.: An exact method for the minimum caterpillar spanning problem. In: Cafieri, S., Mucherino, A., Nannicini, G., Tarissan, F., Liberti, L. (eds.) CTW, pp. 48–51 (2009)Google Scholar