A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems *

unpublished

A rectilinear Steiner tree for a set T of points in the plane is a tree which connects T using horizontal and vertical lines. In the Rectilinear Steiner Tree problem, input is a set T of n points in the Euclidean plane (R 2) and the goal is to find an rectilinear Steiner tree for T of smallest possible total length. A rectilinear Steiner arborecence for a set T of points and root r ∈ T is a rectilinear Steiner tree S for T such that the path in S from r to any point t ∈ T is a shortest path. In

fatcat:r5aweihhwbbqfkqbcp6jweeviu