Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem (Q1400781)
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: Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem |
scientific article; zbMATH DE number 1964604
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem |
scientific article; zbMATH DE number 1964604 |
Statements
Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem (English)
0 references
14 August 2003
0 references
discrete optimization
0 references
divide and conquer
0 references
dynamic programming
0 references
computational complexity
0 references
algorithmic complexity
0 references
structural complexity
0 references
embedding complexity
0 references
treewidth
0 references
Steiner's problem
0 references
Steiner minimal trees
0 references
