Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871)
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 7606090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for solving the line-capacitated minimum Steiner tree problem |
scientific article; zbMATH DE number 7606090 |
Statements
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (English)
0 references
24 October 2022
0 references
combinatorial optimization
0 references
locations of lines
0 references
line-capacitated Steiner trees
0 references
approximation algorithms
0 references
exact algorithms
0 references
0 references
0 references
0 references
0.8360352516174316
0 references
0.8305726647377014
0 references
0.8285754919052124
0 references
0.8285751938819885
0 references