Hardness Results and an Exact Exponential Algorithm for the Spanning Tree Congestion Problem
Spanning tree congestion is a relatively new graph parameter, which has been studied intensively. This paper studies the complexity of the problem to determine the spanning tree congestion for non-sparse graph classes, while it was investigated for some sparse graph classes before. We prove that the problem is NP-hard even for chain graphs and split graphs. To cope with the hardness of the problem, we present a fast (exponential-time) exact algorithm that runs in O ∗ (2 n ) time, where n denotes the number of vertices. Additionally, we provide a constant-factor approximation algorithm for cographs, and a linear-time algorithm for chordal cographs.
KeywordsDiscrete Math Weighted Graph Chordal Graph Hardness Result Graph Class
Unable to display preview. Download preview PDF.
- 1.Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: Fast subset convolution. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC 2007), pp. 67–74 (2007)Google Scholar
- 2.Bodlaender, H.L., Kozawa, K., Matsushima, T., Otachi, Y.: Spanning tree congestion of k-outerplanar graphs. In: WAAC 2010, pp. 34–39 (2010)Google Scholar
- 3.Bodlaender, H.L., Fomin, F.V., Golovach, P.A., Otachi, Y., van Leeuwen, E.J.: Parameterized complexity of the spanning tree congestion problem (submitted)Google Scholar
- 13.Kozawa, K., Otachi, Y.: Spanning tree congestion of rook’s graphs. Discuss. Math. Graph Theory (to appear)Google Scholar
- 16.Law, H.F., Ostrovskii, M.I.: Spanning tree congestion of some product graphs. Indian J. Math. (to appear)Google Scholar