1 citations · 2 across the 6 of their papers we have counts for
1 paper · 2 filters
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…