Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions (Q2867093)
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: Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions |
scientific article; zbMATH DE number 6237078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Speeding up dynamic programming with representative sets. An experimental evaluation of algorithms for Steiner Tree on tree decompositions |
scientific article; zbMATH DE number 6237078 |
Statements
Speeding Up Dynamic Programming with Representative Sets (English)
0 references
10 December 2013
0 references
experimental evaluation
0 references
algorithmic engineering
0 references
Steiner tree
0 references
treewidth
0 references
dynamic programming
0 references
exact algorithms
0 references
0.9845762848854064
0 references
0.7927279472351074
0 references
0.7877059578895569
0 references
0.7745388746261597
0 references
0.7716448307037354
0 references
