Abstract
The first exact algorithm for the obstacle-avoiding Euclidean Steiner tree problem in the plane (in its most general form) is presented. The algorithm uses a two-phase framework — based on the generation and concatenation of full Steiner trees — previously shown to be very successful for the obstacle-free case. Computational results for moderate size problem instances are given; instances with up to 150 terminals have been solved to optimality within a few hours of CPU-time.
Cite
CITATION STYLE
Zachariasen, M., & Winter, P. (1999). Obstacle-avoiding euclidean steiner trees in the plane: An exact algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1619, pp. 282–295). Springer Verlag. https://doi.org/10.1007/3-540-48518-x_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
