Computing optimal rectilinear steiner trees: A survey and experimental evaluation

20Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

Abstract

The rectilinear Steiner tree problem is to find a minimum-length rectilinear interconnection of a set of points in the plane. A reduction from the rectilinear Steiner tree problem to the graph Steiner tree problem allows the use of exact algorithms for the graph Steiner tree problem to solve the rectilinear problem. Furthermore, a number of more direct, geometric algorithms have been devised for computing optimal rectilinear Steiner trees. This paper surveys algorithms for computing optimal rectilinear Steiner trees and presents experimental results comparing nine of them: graph Steiner tree algorithms due to Beasley, Bern, Dreyfus and Wagner, Hakimi, and Shore, Foulds, and Gibbons and geometric algorithms due to Ganley and Cohoon, Salowe and Warme, and Thomborson, Alpern, and Carter. © 1999 Elsevier Science B.V. All rights reserved.

Cite

CITATION STYLE

APA

Ganley, J. L. (1999). Computing optimal rectilinear steiner trees: A survey and experimental evaluation. Discrete Applied Mathematics, 90(1–3), 161–171. https://doi.org/10.1016/S0166-218X(98)00089-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free