#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2006

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jochen Könemann, David Pritchard, Kunlun Tan
- Math. Program.
- 2011

The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph G = (V,E), a set of terminals R ⊆ V , and non-negative costs ce for all edges e ∈ E . Any tree that contains all terminals is called a Steiner tree; the goal is to find a… (More)

- Kunlun Tan
- 2006

The Steiner tree problem is a classical, well-studied, NP-hard optimization problem. Here we are given an undirected graph G = (V,E), a subset R of V of terminals, and nonnegative costs ce for all edges e in E. A feasible Steiner tree for a given instance is a tree T in G that spans all terminals in R. The goal is to compute a feasible Steiner tree of… (More)

- ‹
- 1
- ›