Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809)
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: Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study |
scientific article; zbMATH DE number 474685
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study |
scientific article; zbMATH DE number 474685 |
Statements
Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (English)
0 references
21 March 1994
0 references
approximate algorithms
0 references
minimum rectilinear Steiner tree problem
0 references
two- point-connection strategy
0 references
0 references
0.9327723
0 references
0.92989665
0 references
0.92743945
0 references
0.92196536
0 references
0 references
0 references
0.9179298
0 references
0.9175631
0 references
0.9141672
0 references
