B. Heller, R. Sherwood, and N. Mckeown, The controller placement problem, Proc. of the First Workshop on Hot Topics in Software Defined Networks, ser. HotSDN '12, pp.7-12, 2012.
DOI : 10.1145/2342441.2342444

J. M. Sanner, Y. Hadjadj-aoul, M. Ouzzif, and G. Rubino, Hierarchical clustering for an efficient controllers' placement in software defined networks, 2016 Global Information Infrastructure and Networking Symposium (GIIS), pp.1-7, 2016.
DOI : 10.1109/GIIS.2016.7814936
URL : https://hal.archives-ouvertes.fr/hal-01421587

G. Yao, J. Bi, Y. Li, and L. Guo, On the Capacitated Controller Placement Problem in Software Defined Networks, IEEE Communications Letters, vol.18, issue.8, pp.1339-1342, 2014.
DOI : 10.1109/LCOMM.2014.2332341

J. Liao, H. Sun, J. Wang, Q. Qi, K. Li et al., Density cluster based approach for controller placement problem in large-scale software defined networkings, Computer Networks, vol.112, pp.24-35, 2017.
DOI : 10.1016/j.comnet.2016.10.014

F. J. Ros and P. M. Ruiz, On reliable controller placements in Software-Defined Networks, Computer Communications, vol.77, pp.41-51, 2016.
DOI : 10.1016/j.comcom.2015.09.008

Y. Hu, W. Wang, X. Gong, X. Que, and S. Cheng, On reliability-optimized controller placement for Software-Defined Networks, China Communications, vol.11, issue.2, pp.38-54, 2014.
DOI : 10.1109/CC.2014.6821736

S. Lange, S. Gebert, T. Zinner, P. Tran-gia, D. Hock et al., Heuristic Approaches to the Controller Placement Problem in Large Scale SDN Networks, IEEE Transactions on Network and Service Management, vol.12, issue.1, pp.4-17, 2015.
DOI : 10.1109/TNSM.2015.2402432

A. Jalili, V. Ahmadi, M. Keshtgari, and M. Kazemi, Controller placement in software-defined WAN using multi objective genetic algorithm, 2015 2nd International Conference on Knowledge-Based Engineering and Innovation (KBEI), pp.656-662, 2015.
DOI : 10.1109/KBEI.2015.7436121

J. M. Sanner, M. Ouzzif, and Y. Hadjadj, DICES: A dynamic adaptive service-driven SDN architecture, Proceedings of the 2015 1st IEEE Conference on Network Softwarization (NetSoft), pp.1-5, 2015.
DOI : 10.1109/NETSOFT.2015.7116125
URL : https://hal.archives-ouvertes.fr/hal-01251958

L. W. Beineke, O. R. Oellermann, and R. E. Pippert, The average connectivity of a graph, Discrete Mathematics, vol.252, issue.1-3, pp.31-45, 2002.
DOI : 10.1016/S0012-365X(01)00180-7

J. Bar-ilan and D. Peleg, Approximation algorithms for selecting network centers, pp.343-354, 1991.
DOI : 10.1007/BFb0028274

M. Sakarovitch, . Optimisation-combinatoire-]-r, and . Karp, Programmation discrète, ser. Collection Enseignement des sciences. Hermann Available: https://books.google.fr/books?id=uUrvAAAAMAAJ [13 Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, vol.6, issue.2, pp.182-197, 2002.
DOI : 10.1109/4235.996017
URL : http://work.caltech.edu/amrit/papers/nsga2.ps.gz

S. Knight, H. Nguyen, N. Falkner, R. Bowden, and M. Roughan, The Internet Topology Zoo, Selected Areas in Communications, pp.1765-1775, 2011.
DOI : 10.1109/JSAC.2011.111002

N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck et al., MiniZinc: Towards a Standard CP Modelling Language, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, ser. CP'07, pp.529-543, 2007.
DOI : 10.1007/978-3-540-74970-7_38

D. Arthur and S. Vassilvitskii, K-means++: The advantages of careful seeding, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA '07, pp.1027-1035, 2007.

A. Auger, J. Bader, D. Brockhoff, and E. Zitzler, Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications, Theoretical Computer Science, vol.425, pp.75-103, 2012.
DOI : 10.1016/j.tcs.2011.03.012
URL : https://hal.archives-ouvertes.fr/inria-00638989