G. D. Angelo, G. D. Stefano, and A. Navarra, Bandwidth Constrained Multi-Interface Networks on Current Trends in Theory and Practice of Computer Science (SOFSEM), ser, Proc. of the 37th Int.l Conf 14 TABLE III AVERAGE COMPUTATIONAL TIME. Graph k |V | time (ms) Balls-into-bins 2, pp.202-213, 2011.

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

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

G. Dangelo, G. D. Stefano, and A. Navarra, Minimize the Maximum Duty in Multi-interface Networks, Algorithmica, vol.17, issue.1, pp.274-295, 2012.
DOI : 10.1007/s00453-011-9531-4
URL : https://hal.archives-ouvertes.fr/hal-00643961

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

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. 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

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

S. Athanassopoulos, I. Caragiannis, C. Kaklamanis, and E. Papaioannou, Energy-Efficient Communication in Multi-interface Wireless Networks, 34th Int.l Symp. on Mathematical Foundations of Computer Science (MFCS), ser. LNCS, pp.102-111, 2009.
DOI : 10.1006/jagm.2000.1086

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

V. Bhandari and N. H. Vaidya, Scheduling in Multi-Channel Wireless Networks, Proc. of the 11th Int.l Conf. on Distributed Computing and Networking (ICDCN), pp.6-17, 2010.
DOI : 10.1007/978-3-642-11322-2_6

X. Lin and S. B. , Distributed and provably efficient algorithms for joint channel-assignment, scheduling, and routing in multichannel ad hoc wireless networks, IEEE/ACM Trans. Netw, vol.17, issue.6, pp.1874-1887, 2009.

P. Wan, Y. Cheng, Z. Wang, and F. Yao, Multiflows in multi-channel multi-radio multihop wireless networks, 2011 Proceedings IEEE INFOCOM, pp.846-854, 2011.
DOI : 10.1109/INFCOM.2011.5935308

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

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

V. V. Vazirani, Approximation Algorithms, 2001.
DOI : 10.1007/978-3-662-04565-7

N. Alon, D. Moshkovitz, and S. Safra, -restrictions, ACM Transactions on Algorithms, vol.2, issue.2, pp.153-177, 2006.
DOI : 10.1145/1150334.1150336
URL : https://hal.archives-ouvertes.fr/halshs-00480214

R. Ahuja, T. Magnanti, and J. Orlin, Network Flows: Theory, Algorithms, and Applications, 21] E. Lawer, Combinatorial Optimization: Networks and Matroids, 1976.

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

A. Papadopoulos, J. Mccann, and A. Navarra, Connectionless probabilistic (CoP) routing: an efficient protocol for mobile wireless ad-hoc sensor networks, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005., pp.73-77, 2005.
DOI : 10.1109/PCCC.2005.1460519

M. Raab and A. Steger, ???Balls into Bins??? ??? A Simple and Tight Analysis, 2nd Int.l Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'98, ser. LNCS, pp.159-170, 1998.
DOI : 10.1007/3-540-49543-6_13

R. Albert and A. Barabási, Emergence of scaling in random networks, Science, vol.286, pp.509-512, 1999.

R. Cohen and S. Havlin, Scale-Free Networks Are Ultrasmall, Physical Review Letters, vol.90, issue.5, p.58701, 2003.
DOI : 10.1103/PhysRevLett.90.058701
URL : http://arxiv.org/abs/cond-mat/0205476