Improved Steiner tree algorithms for bounded treewidth (Q1932355): Difference between revisions
From MaRDI portal
Latest revision as of 17:40, 4 April 2025
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
0 references
0 references
1.0000002
0 references
0.9592007
0 references
0.9474329
0 references
0.94613326
0 references
0.9280854
0 references
0.92367476
0 references