Algorithmic expedients for the prize collecting Steiner tree problem (Q1952504)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6168919
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic expedients for the prize collecting Steiner tree problem |
scientific article; zbMATH DE number 6168919 |
Statements
Algorithmic expedients for the prize collecting Steiner tree problem (English)
0 references
31 May 2013
0 references
Steiner tree
0 references
reduction techniques
0 references
worst-case analysis
0 references
valid inequalities
0 references
0 references
0 references
0 references
0 references
0.888693630695343
0 references
0.8857185244560242
0 references
0.8648486137390137
0 references
0.8576854467391968
0 references
