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

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⟩
95 View
44 Download

Share

Gmail Facebook X LinkedIn More