Dynamic Programming for Minimum Steiner Trees

@article{Fuchs2007DynamicPF,
  title={Dynamic Programming for Minimum Steiner Trees},
  author={Bernhard Fuchs and Walter Kern and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith and Xinhui Wang},
  journal={Theory of Computing Systems},
  year={2007},
  volume={41},
  pages={493-500}
}
We present a new dynamic programming algorithm that solves the minimum Steiner tree problem on graphs with k terminals in time O*(ck) for any c > 2. This improves the running time of the previously fastest parameterized algorithm by Dreyfus-Wagner of order O*(3k) and the so-called "full set dynamic programming" algorithm solving rectilinear instances in time O*(2.38k). 

Faster algorithm for optimum Steiner trees

  • J. Vygen
  • Computer Science
    Inf. Process. Lett.
  • 2011

Parameterized Approximation Algorithms for Bidirected Steiner Network Problems

The Directed Steiner Network (DSN) problem takes as input a directed graph G=(V, E) with non-negative edge-weights and a set D V V of k demand pairs. The aim is to compute the cheapest network N G ...

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

Three fundamental network design problems on arc-weighted directed graphs are investigated with respect to the parameters "number of terminals", "an upper bound on the size of the connecting network", and the combination of both.

Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm

The algorithm matches the best known worst-case run time and has a fast, often superior, practical performance: on some large instances originating from VLSI design, previous best run times are improved upon by orders of magnitudes.

An Integral Linear Programming Relaxation for Parameterized Steiner Trees

A novel linear program (LP) for the Steiner Tree problem, where a set of terminal vertices need to be connected by a minimum weight tree in an edge-weighted graph, which shows that the problem admits an integral LP with 3|E| variables and 2|V | constraints.

Exact algorithms for the Steiner Tree Problem

This thesis improves the running time of algorithm to O(2.684k) by showing that the optimum Steiner tree T can be partitioned into T = T1 [ T2 [ T3 in a certain way such that each Ti is a minimum Steiners tree in a suitable contracted graph Gi with less than k 2 terminals.

Title : Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree Year : 2015 Version : Post print

This work gives the first single-exponential time, polynomial-space FPT algorithm for the weighted Steiner Tree problem, and gives an algorithm with running time O(7.97 ·n · logW ) using O(n · lognW · log k) space.

A Fast Heuristic Algorithm for the Steiner Tree Problem with Uniform Edge Weights

  • Xinyu WuYi Zhou
  • Computer Science
    2022 5th International Conference on Pattern Recognition and Artificial Intelligence (PRAI)
  • 2022
An effective iterative local search algorithm for solving the Steiner tree problem in a graph with uniform edge weights using several strong graph reduction techniques and a novel neighborhood generation method, namely Steiner-edge-vertex swap is studied.

Computing Optimal Steiner Trees in Polynomial Space

This paper presents a O(1.55n)-time polynomial-space algorithm for the cardinality version of the Steiner tree problem, where all edge weights are one, and a improved branching strategy based on a improved branch strategy.

On Extended Formulations For Parameterized Steiner Trees

It is proved that Steiner Tree admits an integral LP with O (3 k | E | ) variables and constraints, which matches the runtime of the Dreyfus-Wagner algorithm, and the poof gives a polyhedral perspective on this classic algorithm.
...

References

SHOWING 1-9 OF 9 REFERENCES

A Faster Algorithm for the Steiner Tree Problem

A new algorithm is developed, which improves the running time from O(3kn+2kn2+n3) to (2+δ)k ·poly(n) for arbitrary but fixed δ > 0.

The steiner problem in graphs

An algorithm for solving the Steiner problem on a finite undirected graph is presented. This algorithm computes the set of graph arcs of minimum total length needed to connect a specified set of k

Exact Algorithms for Plane Steiner Tree Problems: A Computational Study

These algorithms — which are based on the generation and concatenation of full Steiner trees — are much more efficient than other approaches and allow exact solutions of problem instances with more than 2000 terminals.

On exact solutions for the rectilinear Steiner tree problem

For random problem instances, this paper improves the theoretical worst-case time bound to O(n 2.38) and proves a running time of less than 2 " ; implementations show drastic improvements.

Optimal Rectilinear Steiner Minimal Trees in O (n22.62n) Time

An algorithm that computes an optimal rectilinear Steiner minimal tree of n points in at most O(n 2 2:62 n) time is presented, which is provably faster than any previous algorithm, and improves the previous best bound for practically solvable instances.

On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results

The theoretical worst-case time bound to O(n2 . . . 2.38n) is improved, for random problem instances the authors prove a running time of αn with a constant α < 2 , which is an enormous improvement for exponential-time algorithms.

The Rectilinear Steiner Tree Problem in NP Complete

The problem of determining the minimum length of an optimum rectilinear Steiner tree for a set A of points in the plane is shown to be NP-complete and the emphasis of the literature on heuristics and special case algorithms is well justified.

On Steiner Minimal Trees with Rectilinear Distance

We consider Steiner minimal trees in the plane with rectilinear distance. The rectilinear distance $d(p_1 ,p_2 )$ between two points $p_1 $, $p_2 $ is $| {x_1 - x_2 } | + | {y_1 - y_2 } |$, where the

Approximation Algorithms for the Steiner Tree Problem in Graphs

The search for good approximation algorithms for the Steiner tree problem in graphs is to find algorithms that have polynomial running time and return solutions that are not far from an optimum solution.