On the edge capacitated Steiner tree problem - ENSTA Paris - École nationale supérieure de techniques avancées Paris Accéder directement au contenu
Article Dans Une Revue Discrete Optimization Année : 2020

On the edge capacitated Steiner tree problem

Résumé

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.
Fichier principal
Vignette du fichier
Cap-Steiner-DO-Juin2020.pdf (558.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02967013 , version 1 (14-10-2020)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More