An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes |
scientific article; zbMATH DE number 6378669
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes |
scientific article; zbMATH DE number 6378669 |
Statements
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (English)
0 references
9 December 2014
0 references
directed Steiner tree
0 references
parameterized complexity
0 references
dynamic programming
0 references
algorithms
0 references
combinatorial problems
0 references
0 references
0.8963296
0 references
0.8963295
0 references
0.8879006
0 references
0.8869016
0 references
0.8848299
0 references
0.8771005
0 references
0.8758821
0 references
0.8748247
0 references
0.8743472
0 references
0.87393284
0 references
