Login / Signup
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
Mark Jones
Daniel Lokshtanov
M. S. Ramanujan
Saket Saurabh
Ondrej Suchý
Published in:
SIAM J. Discret. Math. (2017)
Keyphrases
</>
parameterized complexity
steiner tree
minimum spanning tree
spanning tree
bounded treewidth
fixed parameter tractable
graph theory
weighted graph
facility location
undirected graph
global constraints
graph theoretic
particle swarm optimization
np complete