# Steiner tree problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2015

Highly Cited

2015

- IEEE Transactions on Computers
- 2015

Using insights from biological processes could help to design new optimization techniques for long-standing computationalâ€¦Â (More)

Is this relevant?

Highly Cited

2006

Highly Cited

2006

- Math. Program.
- 2006

The Prize-Collecting Steiner Tree Problem (PCST) on a graph with edge costs and vertex profits asks for a subtree minimizing theâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- SODA
- 2000

We consider variants on the Prize Collecting Steiner Tree problem and on the primal-dual 2-approximation algorithm devised for itâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- SODA
- 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

- Inf. Process. Lett.
- 1999

In this paper, we study the Steiner tree problem with minimum number of Steiner points and bounded edge-length (STPMSPBEL), whichâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- SODA
- 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

- Electronic Colloquium on Computational Complexity
- 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

- Math. Program.
- 1994

In this paper we give some integer programming formulations for the Steiner tree problem on undirected and directed graphs andâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- SODA
- 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)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- SIAM J. Discrete Math.
- 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?