Steiner tree problem

The original problem was stated in the form that has become known as the Euclidean Steiner tree problem or geometric Steiner tree problem: Given N points in the plane, the goal is to connect them by lines of minimum total length in such a way that any two points may be interconnected by line segments either directly or via other points and line segments.

While the problem is named after Steiner, it has first been posed in 1811 by Joseph Diez Gergonne in the following form: "A number of cities are located at known locations on a plane; the problem is to link them together by a system of canals whose total length is as small as possible".^[3]

It may be shown that the connecting line segments do not intersect each other except at the endpoints and form a tree, hence the name of the problem.

The problem for N = 3 has long been considered, and quickly extended to the problem of finding a star network with a single hub connecting to all of the N given points, of minimum total length. However, although the full Steiner tree problem was formulated in a letter by Gauss, its first serious treatment was in a 1934 paper written in Czech by Vojtěch Jarník and Miloš Kössler [cs]. This paper was long overlooked, but it already contains "virtually all general properties of Steiner trees" later attributed to other researchers, including the generalization of the problem from the plane to higher dimensions.^[4]

For the Euclidean Steiner problem, points added to the graph (Steiner points) must have a degree of three, and the three edges incident to such a point must form three 120 degree angles (see Fermat point). It follows that the maximum number of Steiner points that a Steiner tree can have is N − 2, where N is the initial number of given points. (all these properties were established already by Gergonne.)

For N = 3 there are two possible cases: if the triangle formed by the given points has all angles which are less than 120 degrees, the solution is given by a Steiner point located at the Fermat point; otherwise the solution is given by the two sides of the triangle which meet on the angle with 120 or more degrees.

For general N, the Euclidean Steiner tree problem is NP-hard, and hence it is not known whether an optimal solution can be found by using a polynomial-time algorithm. However, there is a polynomial-time approximation scheme (PTAS) for Euclidean Steiner trees, i.e., a near-optimal solution can be found in polynomial time.^[5] It is not known whether the Euclidean Steiner tree problem is NP-complete, since membership to the complexity class NP is not known.

The rectilinear Steiner tree problem is a variant of the geometric Steiner tree problem in the plane, in which the Euclidean distance is replaced with the rectilinear distance. The problem arises in the physical design of electronic design automation. In VLSI circuits, wire routing is carried out by wires that are often constrained by design rules to run only in vertical and horizontal directions, so the rectilinear Steiner tree problem can be used to model the routing of nets with more than two terminals.^[6]

Steiner trees have been extensively studied in the context of weighted graphs. The prototype is, arguably, the Steiner tree problem in graphs. Let G = (V, E) be an undirected graph with non-negative edge weights c and let S ⊆ V be a subset of vertices, called terminals. A Steiner tree is a tree in G that spans S. There are two versions of the problem: in the optimization problem associated with Steiner trees, the task is to find a minimum-weight Steiner tree; in the decision problem the edge weights are integers and the task is to determine whether a Steiner tree exists whose total weight does not exceed a predefined natural number k. The decision problem is one of Karp's 21 NP-complete problems; hence the optimization problem is NP-hard. Steiner tree problems in graphs are applied to various problems in research and industry,^[7] including multicast routing^[8] and bioinformatics.^[9]

A special case of this problem is when G is a complete graph, each vertex v ∈ V corresponds to a point in a metric space, and the edge weights w(e) for each e ∈ E correspond to distances in the space. Put otherwise, the edge weights satisfy the triangle inequality. This variant is known as the metric Steiner tree problem. Given an instance of the (non-metric) Steiner tree problem, we can transform it in polynomial time into an equivalent instance of the metric Steiner tree problem; the transformation preserves the approximation factor.^[10]

While the Euclidean version admits a PTAS, it is known that the metric Steiner tree problem is APX-complete, i.e., unless P = NP, it is impossible to achieve approximation ratios that are arbitrarily close to 1 in polynomial time. There is a polynomial-time algorithm that approximates the minimum Steiner tree to within a factor of ${\displaystyle \ln(4)+\varepsilon \approx 1.386}$;^[11] however, approximating within a factor ${\displaystyle 96/95\approx 1.0105}$ is NP-hard.^[12] For the restricted case of Steiner Tree problem with distances 1 and 2, a 1.25-approximation algorithm is known.^[13] Karpinski and Alexander Zelikovsky constructed PTAS for the dense instances of Steiner Tree problems.^[14]

In a special case of the graph problem, the Steiner tree problem for quasi-bipartite graphs, S is required to include at least one endpoint of every edge in G.

The Steiner tree problem has also been investigated in higher dimensions and on various surfaces. Algorithms to find the Steiner minimal tree have been found on the sphere, torus, projective plane, wide and narrow cones, and others.^[15]

Other generalizations of the Steiner tree problem are the k-edge-connected Steiner network problem and the k-vertex-connected Steiner network problem, where the goal is to find a k-edge-connected graph or a k-vertex-connected graph rather than any connected graph. A further well-studied^[16] generalization is the survivable network design problem (SNDP) where the task is to connect each vertex pair with a given number (possibly 0) of edge- or vertex-disjoint paths.

The Steiner problem has also been stated in the general setting of metric spaces and for possibly infinitely many points.^[17]

The general graph Steiner tree problem can be approximated by computing the minimum spanning tree of the subgraph of the metric closure of the graph induced by the terminal vertices, as first published in 1981 by Kou et al.^[18] The metric closure of a graph ${\displaystyle G}$ is the complete graph in which each edge is weighted by the shortest path distance between the nodes in ${\displaystyle G}$. This algorithm produces a tree whose weight is within a ${\displaystyle 2-2/t}$ factor of the weight of the optimal Steiner tree where ${\displaystyle t}$ is the number of leaves in the optimal Steiner tree; this can be proven by considering a traveling salesperson tour on the optimal Steiner tree. This approximate solution is computable in ${\displaystyle O(|S||V|^{2})}$ polynomial time by first solving the all-pairs shortest paths problem to compute the metric closure, then by solving the minimum spanning tree problem.

Another popular algorithm to approximate the Steiner tree in graphs was published by Takahashi and Matsuyama in 1980.^[19] Their solution incrementally builds up the Steiner tree by starting from an arbitrary vertex, and repeatedly adding the shortest path from the tree to the nearest vertex in ${\displaystyle S}$ that has not yet been added. This algorithm also has ${\displaystyle O(|S||V|^{2})}$ running time, and produces a tree whose weight is within ${\displaystyle 2-2/|S|}$ of optimal.

In 1986, Wu et al.^[20] improved dramatically on the running time by avoiding precomputation of the all-pairs shortest paths. Instead, they take a similar approach to Kruskal's algorithm for computing a minimum spanning tree, by starting from a forest of ${\displaystyle |S|}$ disjoint trees, and "growing" them simultaneously using a breadth-first search resembling Dijkstra's algorithm but starting from multiple initial vertices. When the search encounters a vertex that does not belong to the current tree, the two trees are merged into one. This process is repeated until only one tree remains. By using a Heap (data structure) to implement the priority queue and a disjoint-set data structure to track to which tree each visited vertex belongs, this algorithm achieves ${\displaystyle O(|E|\log |V|)}$ running time, although it does not improve on the ${\displaystyle 2-2/t}$ cost ratio from Kou et al.

A series of papers provided approximation algorithms for the minimum Steiner tree problem with approximation ratios that improved upon the ${\displaystyle 2-2/t}$ ratio. This sequence culminated with Robins and Zelikovsky's algorithm in 2000 which improved the ratio to 1.55 by iteratively improving upon the minimum cost terminal spanning tree. More recently, however, Byrka et al. proved an ${\displaystyle \ln(4)+\varepsilon \leq 1.39}$ approximation using a linear programming relaxation and a technique called iterative, randomized rounding.^[11]

The general graph Steiner tree problem is known to be fixed-parameter tractable, with the number of terminals as a parameter, by the Dreyfus-Wagner algorithm.^[21][22] The running time of the Dreyfus-Wagner algorithm is ${\displaystyle 3^{|S|}{\text{poly}}(n)}$, where n is the number of vertices of the graph and S is the set of terminals. Faster algorithms exist, running in ${\displaystyle c^{|S|}{\text{poly}}(n)}$ time for any ${\displaystyle c>2}$ or, in the case of small weights, ${\displaystyle 2^{|S|}{\text{poly}}(n)W}$ time, where W is the maximum weight of any edge.^[23][24] A disadvantage of the aforementioned algorithms is that they use exponential space; there exist polynomial-space algorithms running in ${\displaystyle 2^{|S|}{\text{poly}}(n)W}$ time and ${\displaystyle (7.97)^{|S|}{\text{poly}}(n)\log W}$ time.^[25][26]

It is known that the general graph Steiner tree problem does not have a parameterized algorithm running in ${\displaystyle 2^{\epsilon t}{\text{poly}}(n)}$ time for any ${\displaystyle \epsilon <1}$, where t is the number of edges of the optimal Steiner tree, unless the Set cover problem has an algorithm running in ${\displaystyle 2^{\epsilon n}{\text{poly}}(m)}$ time for some ${\displaystyle \epsilon <1}$, where n and m are the number of elements and the number of sets, respectively, of the instance of the set cover problem.^[27] Furthermore, it is known that the problem does not admit a polynomial kernel unless ${\displaystyle {\textsf {coNP}}\subseteq {\textsf {NP/poly}}}$, even parameterized by the number of edges of the optimal Steiner tree and if all edge weights are 1.^[28]

While the graph Steiner tree problem does not admit a polynomial kernel unless ${\displaystyle {\textsf {coNP}}\subseteq {\textsf {NP/poly}}}$ parameterized by the number of terminals, it does admit a polynomial-sized approximate kernelization scheme (PSAKS): for any ${\displaystyle \varepsilon >0}$ it is possible to compute a polynomial-sized kernel, which looses only a ${\displaystyle 1+\varepsilon }$ factor in the solution quality.^[29]

When parameterizing the graph Steiner tree problem by the number p of non-terminals (Steiner vertices) in the optimum solution, the problem is W[1]-hard (in contrast to the parameterization by the number of terminals, as mentioned above). At the same time the problem is APX-complete and thus does not admit a PTAS, unless P = NP. However, a parameterized approximation scheme exists, which for any ${\displaystyle \varepsilon >0}$ computes a ${\displaystyle (1+\varepsilon )}$-approximation in ${\displaystyle 2^{O(p^{2}/\varepsilon ^{4})}n^{O(1)}}$ time.^[30] Also a PSAKS exists for this parameterization.^[30]

The Steiner ratio is the supremum of the ratio of the total length of the minimum spanning tree to the minimum Steiner tree for a set of points in the Euclidean plane.^[31]

In the Euclidean Steiner tree problem, the Gilbert–Pollak conjecture is that the Steiner ratio is ${\displaystyle {\tfrac {2}{\sqrt {3}}}\approx 1.1547}$, the ratio that is achieved by three points in an equilateral triangle with a spanning tree that uses two sides of the triangle and a Steiner tree that connects the points through the centroid of the triangle. Despite earlier claims of a proof,^[32] the conjecture is still open.^[33] The best widely accepted upper bound for the problem is 1.2134, by Chung & Graham (1985).

For the rectilinear Steiner tree problem, the Steiner ratio is exactly ${\displaystyle {\tfrac {3}{2}}}$, the ratio that is achieved by four points in a square with a spanning tree that uses three sides of the square and a Steiner tree that connects the points through the center of the square.^[34] More precisely, for ${\displaystyle L_{1}}$ distance the square should be tilted at ${\displaystyle 45^{\circ }}$ with respect to the coordinate axes, while for ${\displaystyle L_{\infty }}$ distance the square should be axis-aligned.

• Opaque forest problem
• Travelling salesman problem