M. Ali, J. Arora, and C. Lund, Allocation of Splitting Nodes in All-Optical Wavelength- Routed Networks Hardness of approximations Approximation algorithms for NP-hard problems, Photonic Network Communications, pp.247-265, 1997.

[. Arora, C. Lund, R. Motwaniayz95-]-n-alon, U. Yuster, and . Zwick, Proof verification and the hardness of approximation problems, Journal of the ACM, vol.45, issue.3, pp.501-555844, 1995.
DOI : 10.1145/278298.278306

[. Bahiense, O. Barahona, and . Porto, Solving steiner tree problems in graphs with lagrangian relaxation, Journal of Combinatorial Optimization, vol.7, issue.3, pp.259-282, 2003.
DOI : 10.1023/A:1027368621279

J. Beasley, An algorithm for the steiner problem in graphs, Networks, vol.12, issue.1, pp.147-159, 1984.
DOI : 10.1002/net.3230140112

J. Beasley, An SST-based algorithm for the steiner problem in graphs, Networks, vol.34, issue.1, pp.1-16, 1989.
DOI : 10.1002/net.3230190102

[. Björklund, . Husfeldt, M. Kaski, and . Koivisto, Fourier meets Möbius : fast subset convolution, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing -STOC '07, pp.67-74, 2007.

[. Chlebík and J. Chlebíková, The Steiner tree problem on graphs: Inapproximability results, Theoretical Computer Science, vol.406, issue.3, pp.207-214, 2008.
DOI : 10.1016/j.tcs.2008.06.046

M. Charikar, C. Chekuri, Z. Cheung, and . Dai, Approximation Algorithms for Directed Steiner Problems, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.192-200, 1998.
DOI : 10.1006/jagm.1999.1042

M. Charikar, C. Chekuri, S. Goel, and . Guha, Rounding via trees, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.114-123, 1998.
DOI : 10.1145/276698.276719

[. Cheng and D. Du, Steiner trees in industry, volume 11 of Combinatorial optimization, 2001.

[. Carr, . Doddi, M. Konjevod, and . Marathe, On the red-blue set cover problem, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.345-353, 2000.

[. Choukhmane, Une heuristique pour le probleme de l'arbre de Steiner. Revue française d'automatique, d'informatique et de recherche opérationnelle, pp.207-212, 1978.

[. Cygan, M. Kowalik, and . Wykurz, Exponential-time approximation of weighted set cover, CR41] R Courrant and H Robbins. What is Mathematics, pp.957-961, 1941.
DOI : 10.1016/j.ipl.2009.05.003

. De-aragão, R. Uchoa, and . Werneck, Dual Heuristics on the Exact Solution of Large Steiner Problems, Electronic Notes in Discrete Mathematics, vol.7, pp.150-153, 2001.
DOI : 10.1016/S1571-0653(04)00247-1

[. Du and X. Hu, Steiner tree problems in computer communication networks, 2008.
DOI : 10.1142/6729

[. Demaine, P. Hajiaghayi, and . Klein, Node-weighted steiner tree and group steiner tree in planar graphs, Automata, Languages and Programming, pp.328-340, 2009.
DOI : 10.1007/978-3-642-02927-1_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.203

C. Duin and S. Voß, Efficient path and vertex exchange in steiner tree algorithms, Networks, vol.29, issue.2, pp.89-105, 1997.
DOI : 10.1002/(SICI)1097-0037(199703)29:2<89::AID-NET3>3.0.CO;2-7

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

[. Ding, . Yu, L. Wang, and . Qin, Finding Top-k Min-Cost Connected Trees in Databases, 2007 IEEE 23rd International Conference on Data Engineering, pp.836-845, 2007.
DOI : 10.1109/ICDE.2007.367929

[. Even, Recursive greedy methods In Handbook of Approximation Algorithms and Metaheuristics (Computer & Information Science Series), chapter 5, 2007.

[. Feige, A threshold of ln n for approximating set cover, Journal of the ACM, vol.45, issue.4, pp.634-652, 1998.
DOI : 10.1145/285055.285059

[. Fomin, D. Grandoni, and . Kratsch, Faster Steiner tree computation in polynomial-space. Algorithms-ESA, 5193(Lecture notes in computer science), pp.430-441, 2008.

[. Fortune, J. Hopcroft, and . 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

. Fuchs, . Kern, . Molle, . Richter, X. Rossmanith et al., Dynamic programming for minimum Steiner trees. Theory of Computing systems, pp.493-500, 2007.

[. Floyd, Algorithm 97: Shortest path, Communications of the ACM, vol.5, issue.6, p.345, 1962.
DOI : 10.1145/367766.368168

[. Flajolet and R. Sedgewick, Analytic combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

[. Garey and D. Johnson, Computers and intractability : a guide to the theory of NP-completeness, 1979.

[. Garey, R. Johnson, and . Tarjan, The Planar Hamiltonian Circuit Problem is NP-Complete, SIAM Journal on Computing, vol.5, issue.4, pp.704-714, 1976.
DOI : 10.1137/0205049

[. Guha and S. Khuller, Improved methods for approximating node weighted Steiner trees and connected dominating sets. Information and computation, pp.57-74, 1999.

[. Garg, R. Konjevod, and . Ravi, A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem, Proceedings of the Ninth Annual ACM- SIAM Symposium on Discrete Algorithms, pp.253-259, 1998.
DOI : 10.1006/jagm.2000.1096

A. Goldberg and R. Tarjan, Finding minimum-cost circulations by canceling negative cycles, Journal of the ACM, vol.36, issue.4, pp.873-886, 1989.
DOI : 10.1145/76359.76368

[. Gordeev and O. Tarastsov, Abstract, Discrete Mathematics and Applications, vol.3, issue.4, pp.339-364, 1993.
DOI : 10.1515/dma-1993-0402

[. Hibi and T. Fujito, Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications, Proceedings of the 38th International Conference on Graph-Theoretic Concepts in Computer Science, pp.215-224, 2012.

[. Hsieh, E. Hsiao-kuang, M. Wu, and . Tsai, FasterDSP : A faster approximation algorithm for directed Steiner tree problem, Journal of information science and Engineering, vol.22, issue.6, pp.1409-1425, 2006.

[. Halperin and R. Krauthgamer, Polylogarithmic inapproximability, Proceedings of the thirty-fifth ACM symposium on Theory of computing , STOC '03, pp.585-594, 2003.
DOI : 10.1145/780542.780628

. Halperin, . Kortsarz, A. Krauthgamer, N. Srinivasan, and . Wang, Integrality Ratio for Group Steiner Trees and Directed Steiner Trees, Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp.275-284, 2007.
DOI : 10.1137/S0097539704445718
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7

[. Helvig, A. Robins, and . Zelikovsky, An improved approximation scheme for the Group Steiner Problem, Networks, vol.18, issue.1, pp.8-20, 2001.
DOI : 10.1002/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R

[. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

[. Koch and A. Martin, Solving Steiner tree problems in graphs to optimality, Networks, vol.32, issue.3, pp.207-232, 1998.
DOI : 10.1002/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O

[. Kou, L. Markowsky, and . Berman, A fast algorithm for Steiner trees, Acta Informatica, vol.30, issue.2, pp.141-145, 1981.
DOI : 10.1007/BF00288961

[. Koch, S. Martin, and . Voß, SteinLib: An Updated Library on Steiner Tree Problems in Graphs, Steiner Tree in Industry, pp.285-325, 2001.
DOI : 10.1007/978-1-4613-0255-1_9

[. Kimelfeld and Y. Sagiv, New algorithms for computing Steiner trees for a fixed number of terminals, 2006.

[. Lucena and J. Beasley, A branch and cut algorithm for the Steiner problem in graphs, Networks, vol.31, issue.1, pp.39-59, 1998.
DOI : 10.1002/(SICI)1097-0037(199801)31:1<39::AID-NET5>3.0.CO;2-L

[. Melkonian, New primal-dual algorithms for Steiner tree problems. Computers and operations research, pp.2147-2167, 2007.
DOI : 10.1016/j.cor.2005.08.009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.87.327

[. Malli, C. Zhang, and . Qiao, Benefit of Multicasting in All-Optical Networks, Proceeding of the SPIE, pp.209-220, 1998.

J. Nederlof, Fast polynomial-space algorithms using möbius inversion : Improving on steiner tree and related problems, Proceedings of the 36th International Colloquium on Automata, Languages and Programming : Part I, LNCS, pp.713-725, 2009.

[. Plestenjak, An algorithm for drawing planar graphs. Software : Practice and Experience, pp.973-984, 1999.

J. Rémy, Un proc??d?? it??ratif de d??nombrement d'arbres binaires et son application ?? leur g??n??ration al??atoire, RAIRO. Informatique th??orique, vol.19, issue.2, pp.179-185, 1985.
DOI : 10.1051/ita/1985190201791

R. Raz, A Parallel Repetition Theorem, SIAM Journal on Computing, vol.27, issue.3, pp.763-803, 1998.
DOI : 10.1137/S0097539795280895

. Reinhard, . Cohen, . Tomasik, M. Barth, and . Weisser, Optimal configuration of an optical network providing predefined multicast transmissions, Computer Networks, vol.56, issue.8, pp.2097-2106, 2012.
DOI : 10.1016/j.comnet.2012.02.005

O. Russakovsky and A. Y. Ng, A Steiner tree approach to efficient object detection, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp.1070-1077, 2010.
DOI : 10.1109/CVPR.2010.5540097

[. Roos, Scheduling for ReMove and other partially connected architectures, 2001.

[. Robertson and P. 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.1999.1919

[. Raz and S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , STOC '97, pp.475-484, 1997.
DOI : 10.1145/258533.258641

V. Reinhard, . Tomasik, M. Barth, and . Weisser, Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks, IFIP Networking, pp.859-870, 2009.
DOI : 10.1007/978-1-4684-2001-2_9

[. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp.770-779, 2000.

P. Scheffler, A Practical Linear Time Algorithm for Disjoint Paths in Graphs with Bounded Tree Width, 1994.

[. Srinivasan, New approaches to covering and packing problems, Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.567-576, 2001.

[. Stanojevic and M. Vujo?evic, An Exact Algorithm for Steiner Tree Problem on Graphs, International Journal of Computers Communications & Control, vol.1, issue.1, pp.41-46, 2006.
DOI : 10.15837/ijccc.2006.1.2271

[. Tarjan, Finding optimum branchings, Networks, vol.4, issue.1, pp.25-35, 1977.
DOI : 10.1002/net.3230070103

[. Vazirani, Approximation algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7

[. Voß, Steiner tree problems in telecommunications, Handbook of optimization in telecommunications, pp.459-492, 2006.

[. Winter, Steiner problem in networks: A survey, Networks, vol.19, issue.2, pp.129-167, 1987.
DOI : 10.1002/net.3230170203

[. Wong, A dual ascent approach for steiner tree problems on a directed graph, Mathematical Programming, vol.7, issue.3, pp.271-287, 1984.
DOI : 10.1007/BF02612335

[. Watel and M. Weisser, A practical greedy approximation for the directed Steiner tree problem, Proceeding of the 8th Annual International Conference on Combinatorial Optimization and Applications, accepté
DOI : 10.1007/s10878-016-0074-0
URL : https://hal.archives-ouvertes.fr/hal-01067151

D. Watel, C. Ma-weisser, D. Bentz, and . Barth, Steiner Problems with Limited Number of Branching Nodes, SIROCCO, pp.310-321, 2013.
DOI : 10.1145/76359.76368
URL : https://hal.archives-ouvertes.fr/hal-00877222

D. Watel, C. Ma-weisser, D. Bentz, and . Barth, Directed Steiner Tree with Branching Constraint, Computing and Combinatorics, pp.263-275, 2014.
DOI : 10.1007/978-3-319-08783-2_23
URL : https://hal.archives-ouvertes.fr/hal-01067142

B. Yan, M. Deogun, and . Ali, Routing in sparse splitting optical networks with multicast traffic, Computer Networks, vol.41, issue.1, pp.89-113, 2003.
DOI : 10.1016/S1389-1286(02)00345-6

[. Zelikovsky, An 11/6-approximation algorithm for the network steiner problem, Algorithmica, vol.17, issue.5, pp.463-470, 1993.
DOI : 10.1007/BF01187035

[. Zelikovsky, A series of approximation algorithms for the acyclic directed steiner tree problem, Algorithmica, vol.9, issue.1, pp.99-110, 1997.
DOI : 10.1007/BF02523690

L. Zosin and S. Khuller, On directed Steiner trees, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp.59-63, 2002.

[. Zachariasen and A. Rohe, Rectilinear group Steiner trees and applications in VLSI design, Mathematical Programming, pp.407-433, 2003.
DOI : 10.1007/s10107-002-0326-x