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*(2n) 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. © 2011 Springer-Verlag.
CITATION STYLE
Okamoto, Y., Otachi, Y., Uehara, R., & Uno, T. (2011). Hardness results and an exact exponential algorithm for the spanning tree congestion problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6648 LNCS, pp. 452–462). https://doi.org/10.1007/978-3-642-20877-5_44
Mendeley helps you to discover research relevant for your work.