An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (Q1603516): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Approximations for Steiner trees with minimum number of Steiner points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Steiner tree problem with minimum number of Steiner points and bounded edge-length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bottleneck Steiner trees in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximations for a bottleneck Steiner tree problem / rank | |||
Normal rank | |||
Revision as of 10:48, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane |
scientific article |
Statements
An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane (English)
0 references
14 July 2002
0 references
Algorithmical approximation
0 references
Algorithms
0 references
Steiner trees
0 references
0 references
