𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parameterized Complexity of the Spanning Tree Congestion Problem

✍ Scribed by Bodlaender, Hans L.; Fomin, Fedor V.; Golovach, Petr A.; Otachi, Yota; Leeuwen, Erik Jan

Book ID
113044290
Publisher
Springer
Year
2011
Tongue
English
Weight
893 KB
Volume
64
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The hybrid spanning tree problem
The hybrid spanning tree problem
✍ Y.L. Chen πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 696 KB
The -capacitated spanning tree problem
The -capacitated spanning tree problem
✍ Esther M. Arkin; Nili Guttmann-Beck; Refael Hassin πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 380 KB
The computational complexity of the ΞΊ-mi
The computational complexity of the ΞΊ-minimum spanning tree problem in graded matrices
✍ T. DudΓ‘s; B. Klinz; G.J. Woeginger πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 524 KB

Given an undirected graph G = (V, E) where each edge e = (i,j) has a length dij >\_ O, the k-minimum spanning tree problem, k-MST for short, is to find a tree T in G which spans at least k vertices and has minimum length l(T) = ~'~(~,j)e T dij. We investigate the computational complexity of the k-mi