Parameterized Complexity of the Spanning Tree Congestion Problem. Bodlaender, H. L., Fomin, F. V., Golovach, P. A., Otachi, Y., & Jan van Leeuwen, E. Algorithmica, 64(1):85-111, 2012.
Parameterized Complexity of the Spanning Tree Congestion Problem [link]Paper  bibtex   
@article{ dblp2427945,
  title = {Parameterized Complexity of the Spanning Tree Congestion Problem},
  author = {Hans L. Bodlaender and Fedor V. Fomin and Petr A. Golovach and Yota Otachi and Erik Jan van Leeuwen},
  author_short = {Bodlaender, H. L. and Fomin, F. V. and Golovach, P. A. and Otachi, Y. and Jan van Leeuwen, E.},
  bibtype = {article},
  type = {article},
  year = {2012},
  key = {dblp2427945},
  id = {dblp2427945},
  biburl = {http://www.dblp.org/rec/bibtex/journals/algorithmica/BodlaenderFGOL12},
  url = {http://dx.doi.org/10.1007/s00453-011-9565-7},
  journal = {Algorithmica},
  pages = {85-111},
  number = {1},
  volume = {64},
  text = {Algorithmica 64(1):85-111 (2012)}
}

Downloads: 0