Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

Jones, Mark; Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Suchý, Ondrej

doi:10.1137/15M103618X

by Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej Suchý

Reference:

Parameterized Complexity of Directed Steiner Tree on Sparse GraphsMark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondrej SuchýSIAM J. Discrete Math., volume 31, number 2, pages 1294–1327, 2017.

Bibtex Entry:

@article{MarkJonesLRamanujanSS17,
  author    = {Mark Jones and
               Daniel Lokshtanov and
               M. S. Ramanujan and
               Saket Saurabh and
               Ondrej Such{\'{y}}},
  title     = {Parameterized Complexity of Directed Steiner Tree on Sparse Graphs},
  journal   = {{SIAM} J. Discrete Math.},
  volume    = {31},
  number    = {2},
  pages     = {1294--1327},
  year      = {2017},
  url       = {10.1137/15M103618X">https://doi.org/10.1137/15M103618X},
  doi       = {10.1137/15M103618X},
  timestamp = {Wed, 05 Jul 2017 14:44:19 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/siamdm/JonesLRSS17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}