An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823)
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: An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 |
scientific article; zbMATH DE number 6510090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 |
scientific article; zbMATH DE number 6510090 |
Statements
An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (English)
0 references
17 November 2015
0 references
approximation algorithms
0 references
partial-terminal Steiner trees
0 references
Steiner tree problem
0 references
0.9542794
0 references
0.9236138
0 references
0.9226392
0 references
0 references
0.9173847
0 references
0.91470844
0 references
0.9130687
0 references
