Parameterized Complexity of Directed Steiner Tree on Sparse Graphs

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

doi:10.1007/978-3-642-40450-4_57

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ýAlgorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings, pages 671–682, 2013.

Bibtex Entry:

@inproceedings{JonesLRamanujanSS13,
  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},
  booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
               France, September 2-4, 2013. Proceedings},
  pages     = {671--682},
  year      = {2013},
  url       = {10.1007/978-3-642-40450-4_57">http://dx.doi.org/10.1007/978-3-642-40450-4_57},
  doi       = {10.1007/978-3-642-40450-4_57},
  timestamp = {Wed, 21 Aug 2013 12:35:01 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/esa/JonesLRSS13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}