Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm

Authors:
Martin Zachariasen;Pawel Winter
Affiliations:
-;-
Venue:
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Year:
1999

Citing 4
Cited 3

An approximation scheme for finding Steiner trees with obstacles

SIAM Journal on Computing
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs

Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Spanning trees in hypergraphs with applications to steiner trees

Spanning trees in hypergraphs with applications to steiner trees

Dealing with large hidden constants: engineering a planar steiner tree PTAS

Journal of Experimental Algorithmics (JEA)
Approximation of octilinear steiner trees constrained by hard and soft obstacles

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A near linear time approximation scheme for steiner tree among obstacles in the plane

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

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.