Parameterized Complexity of Directed Steiner Tree on Sparse Graphs.
Mark JonesDaniel LokshtanovM. S. RamanujanSaket SaurabhOndrej SuchýPublished in: ESA (2013)
Keyphrases
- parameterized complexity
- steiner tree
- minimum spanning tree
- fixed parameter tractable
- bounded treewidth
- graph theory
- global constraints
- facility location
- undirected graph
- graph theoretic
- graph structure
- shortest path
- spanning tree
- np complete
- genetic algorithm
- network design
- random graphs
- directed graph
- bayesian networks