Minimum length disjoint paths and Capacitated (rooted) Steiner Tree - Archive ouverte HAL Access content directly
Conference Papers Year :

Minimum length disjoint paths and Capacitated (rooted) Steiner Tree

(1) , (1, 2) , (3)
1
2
3
Vignette du fichier
ALIO2018-Steiner.pdf (1.54 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02478921 , version 1 (14-02-2020)

Identifiers

  • HAL Id : hal-02478921 , version 1

Cite

Cédric Bentz, Marie-Christine Costa, Alain Hertz. Minimum length disjoint paths and Capacitated (rooted) Steiner Tree. Euro-Alio International Conference on Applied Combinatorial Optimization Aims and Objectives, Jun 2018, Bologna, Italy. ⟨hal-02478921⟩
43 View
29 Download

Share

Gmail Facebook Twitter LinkedIn More