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

S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and E. Papaioannou, Energyefficient communication in multi-interface wireless networks, 34th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), pp.102-111, 2009.

P. Bahl, A. Adya, J. Padhye, and A. Walman, Reconsidering wireless systems with multiple radios, ACM SIGCOMM Computer Communication Review, vol.34, issue.5, pp.39-46, 2004.
DOI : 10.1145/1039111.1039122

M. Caporuscio, D. Charlet, V. Issarny, and A. Navarra, Energetic performance of service-oriented multi-radio networks, Proceedings of the 6th international workshop on Software and performance , WOSP '07, pp.42-45, 2007.
DOI : 10.1145/1216993.1217002
URL : https://hal.archives-ouvertes.fr/inria-00110341

D. Cavalcanti, H. Gossain, and D. Agrawal, Connectivity in multi-radio, multichannel heterogeneous ad hoc networks, IEEE 16th Int. Symp. on Personal, Indoor and Mobile Radio Communications (PIMRC), pp.1322-1326, 2005.

G. D. Angelo, G. D. Stefano, and A. Navarra, Minimizing the Maximum Duty for Connectivity in Multi-Interface Networks, Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA), volume 6509 Part II of LNCS, pp.254-267, 2010.

R. Draves, J. Padhye, and B. Zill, Routing in multi-radio, multi-hop wireless mesh networks, Proceedings of the 10th annual international conference on Mobile computing and networking , MobiCom '04, pp.114-128, 2004.
DOI : 10.1145/1023720.1023732

A. Faragó and S. Basagni, The effect of multi-radio nodes on network connectivity -- a graph theoretic analysis, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, 2008.
DOI : 10.1109/PIMRC.2008.5173153

M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979.

G. Gens and E. Levner, Computational complexity of approximation algorithms for combinatorial problems, 8th Int. Symp. on Mathematical Foundations of Computer Science (MFCS), pp.292-300, 1979.
DOI : 10.1007/3-540-09526-8_26

S. Görtz and A. Klose, Analysis of some greedy algorithms for the single-sink fixed-charge transportation problem, Journal of Heuristics, vol.30, issue.4, pp.331-349, 2009.
DOI : 10.1007/s10732-007-9065-8

M. Güntzer and D. , Approximate minimization algorithms for the 0/1 Knapsack and Subset-Sum Problem, Operations Research Letters, vol.26, issue.2, pp.55-66, 2000.
DOI : 10.1016/S0167-6377(99)00066-8

R. Klasing, A. Kosowski, and A. Navarra, Cost minimization in wireless networks with a bounded and unbounded number of interfaces, Networks, vol.43, issue.3, pp.266-275, 2009.
DOI : 10.1002/net.20266

A. Kosowski, A. Navarra, and M. Pinotti, Exploiting multi-interface networks: Connectivity and Cheapest Paths, Wireless Networks, vol.53, issue.3, pp.1063-1073, 2010.
DOI : 10.1007/s11276-009-0188-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.8214

E. Lawer, Combinatorial Optimization: Networks and Matroids, 1976.