On the Bidirected Cut Rel
On the Bidirected Cut Relaxation for Steiner Forest
On the Bidirected Cut Relaxation for Steiner Forest
arXiv:2412.06518v1 Announce Type: new
Abstract: The Steiner Forest problem is an important generalization of the Steiner Tree problem. We are given an undirected graph with nonnegative edge costs and a collection of pairs of vertices. The task is to compute a cheapest forest with the property that …
