1999

2001

Learn More

Let G = (V, E) be a plane graph with nonnegative edge weights, and let N be a family of k vertex sets N 1 , N 2 ,. .. , N k ⊆ V , called nets. Then a noncrossing Steiner forest for N in G is a set T of k trees T 1 , T 2 ,. .. , T k in G such that each tree T i ∈ T connects all vertices, called terminals, in net N i , any two trees in T do not cross each… (More)

- ‹
- 1
- ›