Skip to Main content Skip to Navigation
Journal articles

On the edge capacitated Steiner tree problem

Abstract : Given a graph G = (V, E) with a root r ∈ V , positive capacities {c(e)|e ∈ E}, and non-negative lengths { (e)|e ∈ E}, the minimum-length (rooted) edge capacitated Steiner tree problem is to find a tree in G of minimum total length, rooted at r, spanning a given subset T ⊂ V of vertices, and such that, for each e ∈ E, there are at most c(e) paths, linking r to vertices in T , that contain e. We study the complexity and approximability of the problem, considering several relevant parameters such as the number of terminals, the edge lengths and the minimum and maximum edge capacities. For all but one combinations of assumptions regarding these parameters, we settle the question, giving a complete characterization that separates tractable cases from hard ones. The only remaining open case is proved to be equivalent to a long-standing open problem. We also prove close relations between our problem and classic Steiner tree as well as vertex-disjoint paths problems.
Document type :
Journal articles
Complete list of metadata

Cited literature [42 references]  Display  Hide  Download
Contributor : Marie-Christine Costa Connect in order to contact the contributor
Submitted on : Wednesday, October 14, 2020 - 4:02:08 PM
Last modification on : Friday, August 5, 2022 - 2:54:01 PM


Files produced by the author(s)



Cédric Bentz, Marie-Christine Costa, Alain Hertz. On the edge capacitated Steiner tree problem. Discrete Optimization, Elsevier, 2020, 38, pp.100607. ⟨10.1016/j.disopt.2020.100607⟩. ⟨hal-02967013⟩



Record views


Files downloads