Subexponential algorithms for rectilinear Steiner tree and arborescence problems (Q3132873)
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: Subexponential algorithms for rectilinear Steiner tree and arborescence problems |
scientific article; zbMATH DE number 6832296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential algorithms for rectilinear Steiner tree and arborescence problems |
scientific article; zbMATH DE number 6832296 |
Statements
30 January 2018
0 references
rectilinear graphs
0 references
Steiner arborescence
0 references
parameterized algorithms
0 references
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems (English)
0 references
0.9766559600830078
0 references
0.847701370716095
0 references
0.834495484828949
0 references
0.8251284956932068
0 references
0.8249636888504028
0 references
