A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
type: Item
instance of: scholarly article
title: A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in \(\Re ^{d }\)
zbMATH Open document ID: 1233.68237
author: Jon W. Van Laarhoven
author: Jeffrey W. Ohlmann
published in: Journal of Heuristics
publication date: 2012-03-09T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6013422
zbMATH Keywords: Steiner tree
zbMATH Keywords: Delaunay triangulation
describes a project that uses: GeoSteiner
describes a project that uses: FindSteinerTree
describes a project that uses: SeDuMi
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s10732-010-9137-z
OpenAlex ID: W1995356291
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: A delaunay triangulation‐based heuristic for the euclidean steiner problem
cites work: Steiner Trees for Ladders
cites work: Two heuristics for the Euclidean Steiner tree problem
cites work: A proof of the Gilbert-Pollak conjecture on the Steiner ratio
cites work: An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
cites work: The Complexity of Computing Steiner Minimal Trees
cites work: Steiner Minimal Trees
cites work: Representation theory of semisimple Hopf algebras
cites work: Q3694703
cites work: Q4542574
cites work: Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3
cites work: How to find Steiner minimal trees in Euclidean \(d\)-space
cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
cites work: An O(N2) heuristic for steiner minimal trees in E3
cites work: Q5657944
cites work: A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
cites work: Local search for the Steiner tree problem in the Euclidean plane
cites work: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
DOI: 10.1007/S10732-010-9137-Z
description: scientific article; zbMATH DE number 6013422