Steiner tree problem

Known as: Steiner ratio, K-node-connected Steiner network problem, K-vertex-connected Steiner network problem 
The Steiner tree problem, motorway problem, or minimum Steiner tree problem, named after Jakob Steiner, is a problem in combinatorial optimization… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Using insights from biological processes could help to design new optimization techniques for long-standing computational… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing the… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We consider variants on the Prize Collecting Steiner Tree problem and on the primal-dual 2-approximation algorithm devised for it… (More)
  • figure 1
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STPMSPBEL), which… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The Steiner tree problem asks for the shortest tree connecting a given set of terminal points in a metric space. We design new… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
In this paper we give some integer programming formulations for the Steiner tree problem on undirected and directed graphs and… (More)
  • figure 5.1
  • figure 5.3
  • figure 5.4
  • figure 7.1
  • figure 7.2
Is this relevant?
Highly Cited
1992
Highly Cited
1992
For a set S contained in a metric space, a Steiner tree of S is a tree that connects the points in S. Finding a minimum cost… (More)
  • figure 2
  • figure 4
  • figure 6
  • figure 8
  • figure 7
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper proposes a new problem, which we call the Dynamic Steiner Tree Problem. This is related to multipoint connection… (More)
Is this relevant?