A. Digital and I. , Online; accessed 08, 2013.

S. Aceda´nskiaceda´nski, S. Deb, M. Médard, and R. Koetter, How Good is Random Linear Coding based Distributed Networked Storage, NetCod, 2005.

R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, Network information flow, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1204-1216, 2000.
DOI : 10.1109/18.850663

R. K. Ahuja, J. B. Orlin, and T. L. Magnanti, Network Flows: Theory, Algorithms and Applications, 1993.

R. K. Ahuja, Algorithms for the minimax transportation problem, Naval Research Logistics Quarterly, vol.5, issue.4, pp.725-739, 1986.
DOI : 10.1002/nav.3800330415

E. Akçali and A. Ungör, Approximation Algorithms for Degree-Constrained Bipartite Network flow, ISCIS, pp.163-170

G. Baier, E. Köhler, and M. Skutella, On the k-Splittable Flow Problem, Proceedings of the 10th Annual European Symposium on Algorithms, pp.101-113, 2002.

G. Baier, E. Köhler, and M. Skutella, The k-Splittable Flow Problem, Algorithmica, vol.42, issue.3-4, pp.231-248, 2005.
DOI : 10.1007/s00453-005-1167-9

J. Barros, R. A. Costa, D. Munaretto, and J. Widmer, Effective Delay Control in Online Network Coding, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.208-216, 2009.
DOI : 10.1109/INFCOM.2009.5061923

P. M. Camerini, The min-max spanning tree problem and some extensions, Information Processing Letters, vol.7, issue.1, pp.10-14, 1978.
DOI : 10.1016/0020-0190(78)90030-3

M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron et al., Splitstream: High-Bandwidth Multicast in Cooperative Environments, Proceedings of of the 19th ACM Symposium on Operating Systems Principles (SOSP), 2003.

D. Chen, R. G. Baston, and Y. Dang, Applied Integer Programming: Modelling and Solution, 2010.
DOI : 10.1002/9781118166000

Y. H. Chen, C. L. Lu, and C. Y. Tang, On the Full and Bottleneck Full Steiner Tree Problems, Proceedings of the 9th Annual International Conference (COCOON), pp.25-28, 2003.
DOI : 10.1007/3-540-45071-8_14

C. Chiang, M. Sarrafzadeh, and C. K. Wong, Global routing based on Steiner min-max trees, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.9, issue.12, pp.1318-1325, 1990.
DOI : 10.1109/43.62776

N. Cleju, N. Thomos, and P. Frossard, Selection of Network Coding Nodes for Minimal Playback Delay in Streaming Overlays, IEEE Transactions on Multimedia, vol.13, issue.5, pp.1204-1216, 2011.
DOI : 10.1109/TMM.2011.2161448

T. H. Cormen, C. Stein, R. L. Rivest, and C. E. Leiserson, Introduction to Algorithms, 2001.

U. Derigs and U. Zimmermann, Ein L??sungsverfahren f??r lineare Engpa??transportprobleme mittels erweiternder Wege, Computing, vol.1, issue.1, pp.1-15, 1979.
DOI : 10.1007/BF02246556

A. G. Dimakis, K. Ramchandran, Y. Wu, and C. Suh, A Survey on Network Codes for Distributed Storage, Proceedings of the IEEE, pp.476-489, 2011.
DOI : 10.1109/JPROC.2010.2096170

Y. Dinitz, N. Garg, and M. X. Goemans, On the Single-Source Unsplittable Flow Problem, Proceedings of 39th Annual Symposium on Foundations of Computer Science, pp.290-299, 1998.
DOI : 10.1007/s004930050043

P. Donovan, B. Shepherd, A. Vetta, and G. Wilfong, Degree-constrained network flows, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.681-688, 2007.
DOI : 10.1145/1250790.1250889

]. P. Donovan, B. Shepherd, A. Vetta, and G. Wilfong, Degree-constrained network flows, Proceedings of the thirty-ninth annual ACM symposium on Theory of computing , STOC '07, pp.681-688, 2007.
DOI : 10.1145/1250790.1250889

C. W. Duin and A. Volgenant, The partial sum criterion for Steiner trees in graphs and shortest paths, European Journal of Operational Research, vol.97, issue.1, pp.172-182, 1997.
DOI : 10.1016/S0377-2217(96)00113-0

J. Edmonds, Edge-Disjoint Branchings Combinatorial Algorithms, pp.91-96, 1972.

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. J. Ferner, M. Médard, and E. Soljanin, Toward sustainable networking: Storage area networks with network coding, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012.
DOI : 10.1109/Allerton.2012.6483262

. L. Jr, D. R. Ford, and . Fulkerson, Maximum Flow through a Network, Canadian Journal of Mathematics, vol.8, pp.399-404, 1956.

. L. Jr, D. R. Ford, and . Fulkerson, A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem, Canadian Journal of Mathematics, vol.9, pp.210-218, 1957.

. L. Jr, D. R. Ford, and . Fulkerson, A Suggested Computation for Maximal Multi-commodity Network Flows, Manage. Sci, vol.5, pp.97-101, 1958.

M. L. Fredman and R. E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, vol.34, issue.3, pp.596-615, 1987.
DOI : 10.1145/28869.28874

H. N. Gabow and R. E. Tarjan, Algorithms for two bottleneck optimization problems, Journal of Algorithms, vol.9, issue.3, pp.411-417, 1988.
DOI : 10.1016/0196-6774(88)90031-4

R. S. Garfinkel and M. R. Rao, The bottleneck transportation problem, Naval Research Logistics Quarterly, vol.16, issue.4, pp.465-472, 1971.
DOI : 10.1002/nav.3800180404

N. Garg, R. Khandekar, K. Kunal, and V. Pandit, Bandwidth Maximization in Multicasting, Proceedings of European Symposium on Algorithms, pp.242-253, 2003.
DOI : 10.1007/978-3-540-39658-1_24

L. Georgiadis, Bottleneck multicast trees in linear time, IEEE Communications Letters, vol.7, issue.11, 2003.
DOI : 10.1109/LCOMM.2003.820102

C. Gkantsidis and P. R. Rodriguez, Network coding for large scale content distribution, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., pp.2235-2245, 2005.
DOI : 10.1109/INFCOM.2005.1498511

M. X. Goemans and Y. S. Myung, A catalog of steiner tree formulations, Networks, vol.28, issue.1, pp.19-28, 1993.
DOI : 10.1002/net.3230230104

N. Golrezaei, K. Shanmugam, A. G. Dimakis, A. F. Molisch, and G. Caire, FemtoCaching: Wireless video content delivery through distributed caching helpers, 2012 Proceedings IEEE INFOCOM, pp.1107-1115, 2012.
DOI : 10.1109/INFCOM.2012.6195469

E. Gourdin and Y. Wang, Some Further Investigation on Maximum Throughput: Does Network Coding Really Help, Proceedings of the 24th International Teletraffic Congress (ITC), 2012.

P. L. Hammer, Time-minimizing transportation problems, Naval Research Logistics Quarterly, vol.6, issue.3, pp.345-367, 1969.
DOI : 10.1002/nav.3800160307

T. Ho and D. S. Lun, Network Coding an introduction, 2008.

T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros et al., Toward a Random Operation of Networks, IEEE Transactions on Information Theory, pp.1-8, 2004.

T. Ho, M. Médard, R. Koetter, D. R. Karger, M. Effros et al., A Random Linear Network Coding Approach to Multicast, IEEE Transactions on Information Theory, vol.52, issue.10, pp.524413-4430, 2006.
DOI : 10.1109/TIT.2006.881746

T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, On Randomized Network Coding, Proceedings of 41st Annual Allerton Conference on Communication, Control, and Computing, 2003.

D. S. Hochbaum and G. J. Woeginger, A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources, Operations Research Letters, vol.24, issue.1-2, pp.25-28, 1999.
DOI : 10.1016/S0167-6377(98)00053-4

S. Jaggi, P. Sanders, P. Chou, M. Effros, S. Egner et al., Polynomial Time Algorithms for Multicast Network Code Construction, IEEE Transactions on Information Theory, vol.51, issue.6, pp.1973-1982, 2005.
DOI : 10.1109/TIT.2005.847712

]. K. Jain, M. Mahdian, and M. R. Salavatipour, Packing Steiner Trees, Proceedings of the 14th annual ACM-SIAM symposium on Discrete algorithms, pp.266-274, 2003.

V. Kaibel and M. A. Peinhardt, On the Bottleneck Shortest Path Problem, 2001.

S. Katti, S. Gollakota, H. Balakrishnan, and M. Médard, Symbol-Level Network Coding for Wireless Mesh Networks, Proceedings of ACM SIG- COMM, pp.401-412, 2008.

S. Katti, S. Gollakota, and D. Katabi, Embracing Wireless Interference: Analog Network Coding, Proceedings of ACM SIGCOMM, pp.397-408, 2007.

S. Katti, H. Rahul, W. Hu, D. Katabi, M. Médard et al., Xors in the Air: Practical Wireless Network Coding, Proceedings of ACM SIGCOMM, 2006.

M. Kim, Network Coding for Robust Wireless Networks, 2012.

M. Kim, C. W. Ahn, M. Médard, and M. Effros, Evolutionary Approaches To Minimizing Network Coding Resources, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, 2006.
DOI : 10.1109/INFCOM.2007.231

M. Kim, M. Médard, V. Aggarwal, U. M. O-'reilly, W. Kim et al., Evolutionary Approaches To Minimizing Network Coding Resources, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.1991-1999, 2007.
DOI : 10.1109/INFCOM.2007.231

M. Kim, M. Médard, and J. Barros, Modeling Network Coded TCP Throughput: A Simple Model and its Validation, Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, 2011.
DOI : 10.4108/icst.valuetools.2011.246509

J. M. Kleinberg, Single-source unsplittable flow, Proceedings of 37th Conference on Foundations of Computer Science, pp.68-77, 1996.
DOI : 10.1109/SFCS.1996.548465
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.1029

T. Koch and A. Martin, Solving Steiner Tree Problems in Graphs to Optimality . Networks, pp.207-232, 1998.

R. Koetter and M. Médard, An algebraic approach to network coding, IEEE/ACM Transactions on Networking, vol.11, issue.5, pp.782-795, 2003.
DOI : 10.1109/TNET.2003.818197

V. P. Kompella, G. C. Polyzos, and J. C. Pasquale, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, vol.1, issue.3, pp.286-292, 1993.
DOI : 10.1109/90.234851
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.8162

A. Kulkarni, M. Heindlmaier, D. Traskov, M. J. Montpetit, and M. Médard, An Implementation of Network Coding with Association Policies in Heterogeneous Networks, Proceedings of the IFIP TC 6th international conference on Networking, pp.110-118, 2011.
DOI : 10.1007/978-3-642-23041-7_11

D. Leong, A. G. Dimakis, and T. Ho, Distributed storage allocation problems, 2009 Workshop on Network Coding, Theory, and Applications, pp.86-91, 2009.
DOI : 10.1109/NETCOD.2009.5191399
URL : http://authors.library.caltech.edu/18214/1/Leong2009p82812009_Workshop_On_Network_Coding_Theory_And_Applications.pdf

D. Leong, A. G. Dimakis, and T. Ho, Distributed Storage Allocation for High Reliability, 2010 IEEE International Conference on Communications, pp.1-6, 2010.
DOI : 10.1109/ICC.2010.5502492

D. Leong, A. G. Dimakis, and T. Ho, Distributed Storage Allocations, IEEE Transactions on Information Theory, vol.58, issue.7, pp.4733-4752, 2012.
DOI : 10.1109/TIT.2012.2191135
URL : http://arxiv.org/abs/1011.5287

S. , Y. R. Li, R. W. Yeung, and C. Ning, Linear Network Coding, IEEE Transactions on Information Theory, vol.49, issue.2, pp.371-381, 2003.
URL : https://hal.archives-ouvertes.fr/hal-01327498

Z. Li, B. Li, D. Jiang, and L. C. Lau, On Achieving Optimal Throughput with Network Coding, Proceedings of IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp.2184-2194, 2005.

Z. Li, B. Li, and L. C. Lau, A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks, IEEE Transactions on Information Theory, vol.55, issue.3, pp.1016-1026, 2009.
DOI : 10.1109/TIT.2008.2011516

D. E. Lucani and M. Médard, Bridging tree-packing and network coding: An information flow approach, 2011 45th Annual Conference on Information Sciences and Systems, pp.1-6, 2011.
DOI : 10.1109/CISS.2011.5766116

D. S. Lun, M. Médard, T. Ho, and R. Koetter, Network Coding with a Cost Criterion Achieving Minimum-Cost Multicast: A Decentralized Approach Based on Network Coding, Proceedings of 2004 International Symposium on Information Theory and its Applications (ISITA) Proceedings of IEEE Conference on Computer Communications (INFOCOM), pp.1232-1237, 2004.

D. S. Lun, N. Ratnakar, M. Médard, R. Koetter, D. R. Karger et al., Minimum-cost multicast over coded packet networks, IEEE Transactions on Information Theory, vol.52, issue.6, pp.2608-2623, 2006.
DOI : 10.1109/TIT.2006.874523
URL : http://arxiv.org/abs/cs/0503064

M. Montpetit and M. Médard, Video-Centric Network Coding Strategies for 4G Wireless Networks: An Overview, 2010 7th IEEE Consumer Communications and Networking Conference, pp.1-5, 2010.
DOI : 10.1109/CCNC.2010.5421629

G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, 1988.
DOI : 10.1002/9781118627372
URL : http://dx.doi.org/10.1016/s0898-1221(99)91259-2

Z. Nutov, Approximating Directed Weighted-Degree Constrained Networks, Proceedings of the 11th International Workshop APPROX and 12th International Workshop RANDOM on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, pp.219-232, 2008.

J. B. Orlin, A Faster Strongly Polynomial Minimum Cost Flow Algorithm, Proceedings of the 20th Annual ACM Symposium on Computing Theory, pp.355-362, 1988.

C. Papadimitriou and M. Yannakakis, Optimization, Approximation, and Complexity Classes, Proceedings of the 20th annual ACM symposium on Theory of Computing, pp.229-234, 1988.
DOI : 10.1016/0022-0000(91)90023-x
URL : http://doi.org/10.1016/0022-0000(91)90023-x

M. G. Resende and P. M. Pardalos, Handbook of Opertimization in Telecommunications. Spinger Science and Business Media, 2006.

G. Robins and A. Zelikovsky, Improved Steiner Tree Approximation in Graphs, Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.770-779, 2000.

L. H. Sahasrabuddhe and B. Mukherjee, Multicast routing algorithms and protocols: a tutorial, IEEE Network, vol.14, issue.1, pp.90-102, 2000.
DOI : 10.1109/65.819175

A. Schrijver, Theory of Linear and Integer Programming, 1986.

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

J. K. Sundararajan, D. Shah, M. Médard, M. Mitzenmacher, and J. Barros, Network Coding Meets TCP: Theory and Implementation, Proceedings of the IEEE, vol.99, issue.3, pp.280-288, 2009.
DOI : 10.1109/JPROC.2010.2093850
URL : http://hdl.handle.net/1721.1/75026

L. B. Toktay and R. Uzsoy, A capacity allocation problem with integer side constraints, European Journal of Operational Research, vol.109, issue.1, pp.170-182, 1998.
DOI : 10.1016/S0377-2217(98)80011-8

H. Wang, J. Liang, and C. C. Kuo, Overview of Robust Video Streaming with Network Coding, Journal of Visual Communication and Image Representation, 2010.

B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol.6, issue.9, pp.1617-1622, 1988.
DOI : 10.1109/49.12889

Y. Wu, P. A. Chou, and K. Jain, A Comparison of Network Coding and Tree Packing, Proceedings of International Symposium on Information Theory (ISIT), p.143, 2004.

X. Yin, X. Wang, J. Zhao, X. Xue, and Z. Li, On Benefits of Network Coding in Bidirected Networks and Hyper-Networks, Proceedings of IEEE Conference on Computer Communications (INFOCOM), pp.325-333, 2012.