{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:14:07Z","timestamp":1725988447832},"publisher-location":"Singapore","reference-count":46,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811314704"},{"type":"electronic","value":"9789811314711"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-981-13-1471-1_5","type":"book-chapter","created":{"date-parts":[[2018,8,18]],"date-time":"2018-08-18T01:33:12Z","timestamp":1534555992000},"page":"115-139","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Multi-objective Optimization to Improve Robustness in Networks"],"prefix":"10.1007","author":[{"given":"R. Chulaka","family":"Gunasekara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chilukuri K.","family":"Mohan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kishan","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,19]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"M.J. Alenazi, J.P. Sterbenz, Comprehensive comparison and accuracy of graph metrics in predicting network resilience, in 2015 11th International Conference on the Design of Reliable Communication Networks (DRCN) (IEEE, 2015), pp. 157\u2013164","DOI":"10.1109\/DRCN.2015.7149007"},{"issue":"9","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1007\/s00500-011-0694-3","volume":"15","author":"S Bechikh","year":"2011","unstructured":"S. Bechikh, L.B. Said, K. Gh\u00e9dira, Searching for knee regions of the pareto front using mobile reference points. Soft Comput. 15(9), 1807\u20131823 (2011)","journal-title":"Soft Comput."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"P.J. Bentley, J.P. Wakefield, in Finding Acceptable Solutions in the Pareto-Optimal Range using Multiobjective Genetic Algorithms (Springer London, 1998), pp 231\u2013240. https:\/\/doi.org\/10.1007\/978-1-4471-0427-8_25","DOI":"10.1007\/978-1-4471-0427-8_25"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"A. Bigdeli, A. Tizghadam, A. Leon-Garcia, Comparison of network criticality, algebraic connectivity, and other graph metrics, in Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners (ACM, 2009), p.\u00a04","DOI":"10.1145\/1610304.1610308"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s13278-013-0096-x","volume":"3","author":"P Boldi","year":"2013","unstructured":"P. Boldi, M. Rosa, Robustness of social and web graphs to node removal. Soc. Netw. Anal. Min. 3(4), 829\u2013842 (2013)","journal-title":"Soc. Netw. Anal. Min."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"P. Boldi, M. Rosa, S. Vigna, Robustness of Social Networks: Comparative Results Based on Distance Distributions (Springer, 2011)","DOI":"10.1007\/978-3-642-24704-0_7"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1284680.1284681","volume":"10","author":"D Chakrabarti","year":"2008","unstructured":"D. Chakrabarti, Y. Wang, C. Wang, J. Leskovec, C. Faloutsos, Epidemic thresholds in real networks. ACM Trans. Inf. Syst. Secur. (TISSEC) 10(4), 1 (2008)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"H. Chan, L. Akoglu, in Optimizing network robustness by edge rewiring: A general framework. Data Mining and Knowledge Discovery (DAMI), 2016","DOI":"10.1007\/s10618-015-0447-5"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"H. Chan, L. Akoglu, H. Tong, Make it or break it: manipulating robustness in large networks, in Proceedings of the 2014 SIAM Data Mining Conference (SIAM, 2004), pp. 325\u2013333","DOI":"10.1137\/1.9781611973440.37"},{"issue":"4","key":"5_CR10","first-page":"63","volume":"1","author":"P Chaudhari","year":"2010","unstructured":"P. Chaudhari, R. Dharaskar, V. Thakare, Computing the most significant solution from pareto front obtained in multi-objective evolutionary. Int. J. Adv. Comput. Sci. Appl. 1(4), 63\u201368 (2010)","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"issue":"1","key":"5_CR11","first-page":"51","volume":"2","author":"M Cheikh","year":"2010","unstructured":"M. Cheikh, B. Jarboui, T. Loukil, P. Siarry, A method for selecting pareto optimal solutions in multiobjective optimization. J. Inf. Math. Sci. 2(1), 51\u201362 (2010)","journal-title":"J. Inf. Math. Sci."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"D.W. Corne, J.D. Knowles, Techniques for highly multiobjective optimisation: some nondominated points are better than others, in Proceedings of the 9th annual conference on Genetic and evolutionary computation (ACM, 2007), pp 773\u2013780","DOI":"10.1145\/1276958.1277115"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"K. Deb, S. Agrawal, A. Pratap, T. Meyarivan, A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: Nsga-ii, in Parallel Problem Solving from Nature PPSN VI, (Springer, 2000), pp. 849\u2013858","DOI":"10.1007\/3-540-45356-3_83"},{"key":"5_CR14","unstructured":"F. di\u00a0Pierro, Many-objective evolutionary algorithms and applications to water resources engineering. Ph.D. thesis, University of Exeter, 2006"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"N. Drechsler, R. Drechsler, B. Becker, Multi-objective optimisation based on relation favour, in International Conference on Evolutionary Multi-criterion Optimization (Springer, 2001), pp. 154\u2013166","DOI":"10.1007\/3-540-44719-9_11"},{"key":"5_CR16","unstructured":"W. Ellens, Effective resistance and other graph measures for network robustness. Ph.D. thesis, Master thesis, Leiden University, 2011, https:\/\/www.math.leidenuniv.nl\/scripties\/EllensMaster.pdf"},{"key":"5_CR17","unstructured":"W. Ellens, R.E. Kooij, Graph Measures and Network Robustness, 2013. arXiv:13115064"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"M. Farina, P. Amato, On the optimal solution definition for many-criteria optimization problems, in Fuzzy Information Processing Society, 2002. Proceedings. NAFIPS. 2002 Annual Meeting of the North American, 2002, pp. 233\u2013238. https:\/\/doi.org\/10.1109\/NAFIPS.2002.1018061","DOI":"10.1109\/NAFIPS.2002.1018061"},{"issue":"2","key":"5_CR19","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M Fiedler","year":"1973","unstructured":"M. Fiedler, Algebraic connectivity of graphs. Czechoslov. Math. J 23(2), 298\u2013305 (1973)","journal-title":"Czechoslov. Math. J"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"M. Garza-Fabre, G.T. Pulido, C.A.C. Coello, Ranking methods for many-objective optimization, in Mexican International Conference on Artificial Intelligence, (Springer, 2009), pp. 633\u2013645","DOI":"10.1007\/978-3-642-05258-3_56"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1137\/050645452","volume":"50","author":"A Ghosh","year":"2008","unstructured":"A. Ghosh, S. Boyd, A. Saberi, Minimizing effective resistance of a graph. SIAM Rev. 50(1), 37\u201366 (2008)","journal-title":"SIAM Rev."},{"issue":"1","key":"5_CR22","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"J.A. Hartigan, M.A. Wong, Algorithm as 136: a k-means clustering algorithm. J. R. Stat. Soc. Ser. C (Applied Statistics) 28(1), 100\u2013108 (1979)","journal-title":"J. R. Stat. Soc. Ser. C (Applied Statistics)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"H.J. Herrmann, C.M. Schneider, AA.. Moreira, J.S. Andrade\u00a0Jr., S. Havlin, Onion-like network topology enhances robustness against malicious attacks. J. Stat. Mech. Theory Exp. 2011(01), 01\u2013027 (2011)","DOI":"10.1088\/1742-5468\/2011\/01\/P01027"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"A. Jamakovic, P. van\u00a0Mieghem, On the Robustness of Complex Networks by using the Algebraic Connectivity (Springer, 2008)","DOI":"10.1007\/978-3-540-79549-0_16"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"W. Jun, M. Barahona, T. Yue-Jin, D. Hong-Zhong, Natural connectivity of complex networks. Chin. Phys. Lett. 27(7), 078\u2013902 (2010)","DOI":"10.1088\/0256-307X\/27\/7\/078902"},{"key":"5_CR26","unstructured":"L.T. Le, T. Eliassi-Rad, H. Tong, Met: a fast algorithm for minimizing propagation in large graphs with small eigen-gaps, in Proceedings of the 2015 SIAM International Conference on Data Mining, SDM, SIAM, vol.\u00a015, 2015, pp. 694\u2013702"},{"key":"5_CR27","first-page":"942","volume":"12","author":"FD Malliaros","year":"2012","unstructured":"F.D. Malliaros, V. Megalooikonomou, C. Faloutsos, Fast robustness estimation in large social graphs: communities and anomaly detection. SDM, SIAM 12, 942\u2013953 (2012)","journal-title":"SDM, SIAM"},{"issue":"3","key":"5_CR28","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0378-4371(00)00311-3","volume":"285","author":"M Marchiori","year":"2000","unstructured":"M. Marchiori, V. Latora, Harmony in the small-world. Phys. A Stat. Mech. Appl. 285(3), 539\u2013546 (2000)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"G.S. Peng, J. Wu, Optimal network topology for structural robustness based on natural connectivity. Phys. Stati. Mech. Appl. 443, 212\u2013220 (2016)","DOI":"10.1016\/j.physa.2015.09.023"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"P.J. Rousseeuw, Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"issue":"10","key":"5_CR31","doi-asserted-by":"publisher","first-page":"3838","DOI":"10.1073\/pnas.1009440108","volume":"108","author":"CM Schneider","year":"2011","unstructured":"C.M. Schneider, A.A. Moreira, J.S. Andrade, S. Havlin, H.J. Herrmann, Mitigation of malicious attacks on networks. Proc. Nat. Acad. Sci. 108(10), 3838\u20133841 (2011)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"3","key":"5_CR32","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"N. Srinivas, K. Deb, Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3), 221\u2013248 (1994)","journal-title":"Evol. Comput."},{"key":"5_CR33","unstructured":"G. Stewart, J.G. Sun, Matrix Perturbation Theory (computer science and scientific computing), 1990"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.engappai.2014.10.020","volume":"38","author":"S Sudeng","year":"2015","unstructured":"S. Sudeng, N. Wattanapongsakorn, Post pareto-optimal pruning algorithm for multiple objective optimization using specific extended angle dominance. Eng. Appl. Artif. Intell. 38, 221\u2013236 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"10","key":"5_CR35","first-page":"5465","volume":"219","author":"A Sydney","year":"2013","unstructured":"A. Sydney, C. Scoglio, D. Gruenbacher, Optimizing algebraic connectivity by edge rewiring. Appl. Math. Comput. 219(10), 5465\u20135479 (2013)","journal-title":"Appl. Math. Comput."},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"T. Tanizawa, S. Havlin, H.E. Stanley, Robustness of onionlike correlated networks against targeted attacks. Phys. Rev. E 85(4), 046\u2013109 (2012)","DOI":"10.1103\/PhysRevE.85.046109"},{"issue":"1","key":"5_CR37","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/JSAC.2010.100105","volume":"28","author":"A Tizghadam","year":"2010","unstructured":"A. Tizghadam, A. Leon-Garcia, Autonomic traffic engineering for network robustness. IEEE J. Sel. Areas Commun. 28(1), 39\u201350 (2010)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"H. Tong, B.A. Prakash, C. Tsourakakis, T. Eliassi-Rad, C. Faloutsos, D.H. Chau, On the vulnerability of large graphs, in 2010 IEEE 10th International Conference on Data Mining (ICDM) (IEEE, 2010), pp. 1091\u20131096","DOI":"10.1109\/ICDM.2010.54"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"H. Tong, B.A. Prakash, T. Eliassi-Rad, M. Faloutsos, C. Faloutsos, Gelling, and melting, large graphs by edge manipulation, in Proceedings of the 21st ACM International Conference on Information and knowledge Management (ACM, 2012), pp 245\u2013254","DOI":"10.1145\/2396761.2396795"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"H. Wang, P. van\u00a0Mieghem, Algebraic connectivity optimization via link addition, in Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2008, p.\u00a022","DOI":"10.4108\/ICST.BIONETICS2008.4691"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"T. Watanabe, N. Masuda, Enhancing the spectral gap of networks by node removal. Phys. Rev. E 82(4), 046\u2013102 (2010)","DOI":"10.1103\/PhysRevE.82.046102"},{"issue":"6684","key":"5_CR42","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"D.J. Watts, S.H. Strogatz, Collective dynamics of small-world networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"6","key":"5_CR43","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1002\/atr.1212","volume":"48","author":"LJ Wismans","year":"2014","unstructured":"L.J. Wismans, T. Brands, E.C. Van Berkum, M.C. Bliemer, Pruning and ranking the pareto optimal set, application for the dynamic multi-objective network design problem. J. Adv. Transp. 48(6), 588\u2013607 (2014)","journal-title":"J. Adv. Transp."},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Z.X. Wu, P. Holme, Onion structure and network robustness. Phys. Rev. E 84(2), 026\u2013106 (2011)","DOI":"10.1103\/PhysRevE.84.026106"},{"issue":"12","key":"5_CR45","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1016\/j.envsoft.2011.07.016","volume":"26","author":"A Yazdani","year":"2011","unstructured":"A. Yazdani, R.A. Otoo, P. Jeffrey, Resilience enhancing expansion strategies for water distribution systems: a network theory approach. Environ. Model. Softw. 26(12), 1574\u20131582 (2011)","journal-title":"Environ. Model. Softw."},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"A. Zeng, W. Liu, Enhancing network robustness against malicious attacks. Phys. Rev. E 85(6), 066\u2013130 (2012)","DOI":"10.1103\/PhysRevE.85.066130"}],"container-title":["Multi-Objective Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-1471-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T18:48:25Z","timestamp":1604774905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-1471-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9789811314704","9789811314711"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-1471-1_5","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}