Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
From MaRDI portal
Publication:1961044
DOI10.1007/PL00009287zbMath0944.68146OpenAlexW2058250759MaRDI QIDQ1961044
Pawel Winter, Martin Zachariasen
Publication date: 9 March 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009287
Graph theory (including graph drawing) in computer science (68R10) General theory of computer systems (68M01)
Related Items (6)
Exact computation of Steiner minimal trees in the plane ⋮ Short trees in polygons ⋮ Multi-label Learning Through Minimum Spanning Tree-Based Subset Selection and Feature Extraction ⋮ The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study ⋮ Local search for the Steiner tree problem in the Euclidean plane ⋮ A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
Uses Software
This page was built for publication: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
