Learn More

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 c e for all edges e ∈ E. Any tree that contains all terminals is called a Steiner tree; the goal is to find a… (More)

- ‹
- 1
- ›