Improved Steiner tree algorithms for bounded treewidth (Q1932355): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2012.04.016 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003272551 / rank | |||
Normal rank | |||
Revision as of 17:42, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Steiner tree algorithms for bounded treewidth |
scientific article |
Statements
Improved Steiner tree algorithms for bounded treewidth (English)
0 references
18 January 2013
0 references
(prize-collecting) Steiner tree
0 references
\(k\)-cardinality tree
0 references
bounded treewidth
0 references
fixed parameter tractable
0 references
exact algorithm
0 references
