"A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane"@en . "V, Z(MSM 261100009), Z(MSM 262100024)" . . . "Bratislava (Slovakia)" . "RIV/00216305:26210/04:PU47004!RIV11-MSM-26210___" . "The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed." . "6"^^ . "1"^^ . . . "A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane" . "552883" . "Proceedings of the 3rd International Conference Aplimat" . "80-227-1995-1" . "\u0160eda, Milo\u0161" . "1"^^ . . . "A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane"@en . . . "Slovensk\u00E1 technick\u00E1 univerzita v Bratislave" . . . . . "26210" . "RIV/00216305:26210/04:PU47004" . . . "[762335D95AE3]" . "Steiner tree, minimum spanning tree, Delaunay triangulation, heuristic"@en . "Bratislava" . "The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed."@en . . "A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane" . . . . "2004-02-03+01:00"^^ . .