Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (Q6601971)
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: Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem |
scientific article; zbMATH DE number 7910605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem |
scientific article; zbMATH DE number 7910605 |
Statements
Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (English)
0 references
11 September 2024
0 references
1-line minimum Steiner tree of line segments
0 references
minimum spanning tree of line segments
0 references
Voronoi diagram of line segments
0 references
Steiner ratio
0 references
approximation algorithms
0 references
0 references
0 references
