On the edge capacitated Steiner tree problem

Cedric Bentz, Marie-Christine Costa, Alain Hertz

Given a graph G = (V,E) with a root r in V, positive capacities {c(e)|e in E}, and non-negative lengths {l(e)|e in E}, the minimum-length (rooted) edge capacitated Steiner tree pro…