A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees (Q4840221)
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: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees |
scientific article; zbMATH DE number 777609
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees |
scientific article; zbMATH DE number 777609 |
Statements
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees (English)
0 references
11 April 1996
0 references
node-weighted Steiner tree problem
0 references
0.8597847819328308
0 references
0.8476675152778625
0 references
