Publication detail
A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane
ŠEDA, M.
English title
A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane
Type
Paper in proceedings (conference paper)
Language
en
Original abstract
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.
Released
2004-02-01
Publisher
Slovak University of Technology
Location
Bratislava (Slovakia)
ISBN
80-227-1995-1
Book
Proceedings of the 3rd International Conference Aplimat
Pages from–to
913–
Pages count
6
BIBTEX
@inproceedings{BUT12868,
author="Miloš {Šeda}",
title="A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane",
booktitle="Proceedings of the 3rd International Conference Aplimat",
year="2004",
pages="6",
publisher="Slovak University of Technology",
address="Bratislava (Slovakia)",
isbn="80-227-1995-1"
}