E. M. Arkin, N. Guttmann-beck, and R. Hassin, The (K,k)-Capacitated Spanning Tree Problem, Discrete Optimization, vol.9, pp.258-266, 2012.
DOI : 10.1007/978-3-642-14355-7_4

M. Bern and P. Plassmann, The Steiner problem with edge lengths 1 and 2, Information Processing Letters, vol.32, issue.4, pp.171-176, 1989.
DOI : 10.1016/0020-0190(89)90039-2

A. Björklund and T. Husfeldt, Shortest Two Disjoint Paths in Polynomial Time, Proceedings ICALP, pp.211-222, 2014.
DOI : 10.1007/978-3-662-43948-7_18

C. Bousba and L. A. Wolsey, Finding minimum cost directed trees with demands and capacities, Annals of Operations Research, vol.28, issue.C, pp.285-303, 1991.
DOI : 10.1007/BF02071977

J. Byrka, F. Grandoni, T. Rothvoß, and L. Sanità, Approximation algorithms for directed Steiner problems, Proceedings STOC, pp.583-592, 2010.

M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel et al., An improved LP-based approximation for Steiner tree, Proceedings SODA, pp.192-200, 1998.

J. Cong, A. B. Kahng, and K. Leung, Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.17, issue.1, pp.24-39, 1998.
DOI : 10.1109/43.673630

S. E. Dreyfus and R. A. Wagner, The steiner problem in graphs, Networks, vol.1, issue.3, pp.195-207, 1971.
DOI : 10.1002/net.3230010302

G. Duan and Y. Yu, Power distribution system optimization by an algorithm for capacitated Steiner tree problems with complex-flows and arbitrary cost functions, International Journal of Electrical Power & Energy Systems, vol.25, issue.7, pp.515-523, 2003.
DOI : 10.1016/S0142-0615(02)00128-X

J. Edmonds and R. M. Karp, Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, Journal of the ACM, vol.19, issue.2, pp.248-264, 1972.
DOI : 10.1145/321694.321699

U. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.314-318, 1996.
DOI : 10.1145/285055.285059

J. Feldman and M. , The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals, SIAM Journal on Computing, vol.36, issue.2, pp.543-561, 2006.
DOI : 10.1137/S0097539704441241

T. Fenner, O. Lachish, and A. Popa, Min-sum 2-paths problems, Proceedings WAOA 2013, pp.1-11, 2014.
DOI : 10.1007/s00224-014-9569-1

S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoretical Computer Science, vol.10, issue.2, pp.111-121, 1980.
DOI : 10.1016/0304-3975(80)90009-2

M. R. Garey and D. S. Johnson, Computers and intractability, a guide to the theory of NP-completeness, 1979.

M. Gondran and M. Minoux, Graphs and Algorithms, 1984.
URL : https://hal.archives-ouvertes.fr/hal-01304880

M. Hajiaghayi, R. Khandekar, G. Kortsarz, and Z. Nutov, On fixed cost k-flow problems, Proceedings WAOA 2013, pp.49-60, 2014.
DOI : 10.1007/s00224-014-9572-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.7783

F. K. Hwang, D. S. Richards, and P. Winter, Steiner tree problems, Networks, vol.20, issue.1, 1992.
DOI : 10.1002/net.3230220105

R. Jothi and B. Raghavachari, Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design, ACM Transactions on Algorithms, vol.1, issue.2, pp.265-282, 2005.
DOI : 10.1145/1103963.1103967

Y. Kobayashi and C. Sommer, On shortest disjoint paths in planar graphs, Discrete Optimization, vol.7, issue.4, pp.234-245, 2010.
DOI : 10.1016/j.disopt.2010.05.002

K. Lee, K. Park, and S. Park, Design of capacitated networks with tree configurations, Telecommunication Systems, vol.23, issue.1, pp.6-7, 1996.
DOI : 10.1007/BF02114283

B. Ma and L. Wang, On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints, Journal of Computer and System Sciences, vol.60, issue.1, pp.1-12, 2000.
DOI : 10.1006/jcss.1999.1661

C. H. Papadimitriou, The complexity of the capacitated tree problem, Networks, vol.4, issue.3, pp.217-230, 1978.
DOI : 10.1002/net.3230080306

H. J. Prömel and A. Steger, The Steiner Tree Problem, Advanced Lectures in Mathematics, 2002.
DOI : 10.1007/978-3-322-80291-0

N. Robertson and P. D. Seymour, Graph Minors .XIII. The Disjoint Paths Problem, Journal of Combinatorial Theory, Series B, vol.63, issue.1, pp.65-110, 1995.
DOI : 10.1006/jctb.1995.1006
URL : http://doi.org/10.1006/jctb.1996.0059

A. Schrijver, Combinatorial Optimization, Polyhedra and Efficiency, 2003.

A. Slivkins, Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs, Proceedings ESA, pp.482-493, 2003.
DOI : 10.1137/070697781

C. A. Tovey, A simplified NP-complete satisfiability problem, Discrete Applied Mathematics, vol.8, issue.1, pp.85-89, 1984.
DOI : 10.1016/0166-218X(84)90081-7
URL : http://doi.org/10.1016/0166-218x(84)90081-7

E. Uchoa, R. Fukasawa, J. Lysgaard, A. Pessoa, M. Poggi-de-aragão et al., Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation, Mathematical Programming, vol.44, issue.2, pp.443-472, 2008.
DOI : 10.1007/s10107-006-0043-y

S. Voß, Capacitated minimum spanning trees, in Encyclopedia of Optimization, Kluwer, pp.25-235, 2001.

D. Watel, M. Weisser, C. Bentz, and D. Barth, An FPT algorithm in polynomial space for the Directed Steiner Tree problem with Limited number of Diffusing nodes, Information Processing Letters, vol.115, issue.2, pp.275-279, 2015.
DOI : 10.1016/j.ipl.2014.09.027
URL : https://hal.archives-ouvertes.fr/hal-01103372

D. B. West, Introduction to Graph Theory, 2001.

B. Y. Wu, On the maximum disjoint paths problem on edge-colored graphs, Discrete Optimization 9, pp.50-57, 2012.