{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:54:47Z","timestamp":1743062087285,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319985565"},{"type":"electronic","value":"9783319985572"}],"license":[{"start":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T00:00:00Z","timestamp":1535241600000},"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":[[2019]]},"DOI":"10.1007\/978-3-319-98557-2_29","type":"book-chapter","created":{"date-parts":[[2018,8,25]],"date-time":"2018-08-25T03:54:42Z","timestamp":1535169282000},"page":"321-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reliable Network Design Problem Considering Cost to Improve Link\u00a0Reliability"],"prefix":"10.1007","author":[{"given":"Keyaki","family":"Uji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyoshi","family":"Miwa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,26]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, St. Louis, 22\u201324 October 1990","DOI":"10.1109\/FSCS.1990.89593"},{"issue":"16","key":"29_CR2","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1016\/j.dam.2006.04.017","volume":"154","author":"T Ishii","year":"2006","unstructured":"Ishii, T., Hagiwara, M.: Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs. Discrete Appl. Math. 154(16), 2307\u20132329 (2006)","journal-title":"Discrete Appl. Math."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-45753-4_17","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"Guy Kortsarz","year":"2002","unstructured":"Kortsarz, G., Krauthgamer, R., Lee, J.R.: Hardness of Approximation for Vertex-Connectivity Network Design Problems, vol. 2462, pp. 185\u2013199. Springer, Heidelberg (2002)"},{"issue":"7","key":"29_CR4","doi-asserted-by":"publisher","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","volume":"36","author":"A Arulselvan","year":"2009","unstructured":"Arulselvan, A., Commander, C.W., Elefteriadou, L., Pardalos, P.M.: Detecting critical nodes in sparse graph. Proc. Comput. Oper. Res. 36(7), 2193\u20132200 (2009)","journal-title":"Proc. Comput. Oper. Res."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Imagawa, K., Fujimura, T., Miwa, H.: Approximation algorithms for finding protected links to keep small diameter against link failures. In: Proceedings of INCoS2011, Fukuoka, Japan, 30 November 2011\u2013December 1\u20132 2011","DOI":"10.1109\/INCoS.2011.57"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Imagawa, K., Miwa, H.: Detecting protected links to keep reachability to server against failures. In: Proceedings of ICOIN2013, Bangkok, 28\u201330 January 2013","DOI":"10.1109\/ICOIN.2013.6496347"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Imagawa, K., Miwa, H.: Approximation algorithm for finding protected links to keep small diameter against link failures. In: Proceedings of INCoS2011, Fukuoka, Japan, pp. 575\u2013580, 30 November 2011\u20132 December 2011","DOI":"10.1109\/INCoS.2011.57"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Maeda, N., Miwa, H.: Detecting critical links for keeping shortest distance from clients to servers during failures. In: Proceedings of HEUNET2012\/SAINT2012, Turkey, 16\u201320 July 2012","DOI":"10.1109\/SAINT.2012.58"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Irie, D., Kurimoto, S., Miwa, H.: Detecting critical protected links to keep connectivity to servers against link failures. In: Proceedings of NTMS 2015, Paris, pp. 1\u20135, 27\u201329 July 2015","DOI":"10.1109\/NTMS.2015.7266485"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Fujimura, T., Miwa, H.: Critical links detection to maintain small diameter against link failures. In: Proceedings of INCoS2010, Thessaloniki, pp. 339\u2013343, 16\u201324 November 2011","DOI":"10.1109\/INCOS.2010.41"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Yamasaki, T., Anan, M., Miwa, H.: Network design method based on link protection taking account of the connectivity and distance between sites. In: Proceedings of INCoS2016, Ostrava, pp. 339\u2013343, 7\u20139 September 2016","DOI":"10.1109\/INCoS.2016.74"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Irie, D., Anan, M., Miwa, H.: Network design method by finding server placement and protected links to keep connectivity to servers against link failures. In: Proceedings of INCoS2016, Ostrava, pp. 439-344, 7\u20139 September 2016","DOI":"10.1109\/INCoS.2016.73"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0026-2714(82)90007-5","volume":"22","author":"KK Aggarwal","year":"1982","unstructured":"Aggarwal, K.K., Chopra, Y.C., Bajwa, J.S.: Topological layout of links for optimising the overall reliability in a computer communication system. Microelectron. Reliab. 22, 347\u2013351 (1982)","journal-title":"Microelectron. Reliab."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/24.210272","volume":"42","author":"R-H Jan","year":"1993","unstructured":"Jan, R.-H., Hwang, F.-J., Chen, S.-T.: Topological optimization of a communication network subject to a reliability constraint. IEEE Trans. Reliab. 42, 63\u201370 (1993)","journal-title":"IEEE Trans. Reliab."},{"issue":"5","key":"29_CR15","first-page":"784","volume":"E82A","author":"T Koide","year":"1990","unstructured":"Koide, T., Shinmori, S., Ishii, H.: The evaluations on lower bounds of all-terminal reliability by arc-packings for general networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E82A(5), 784\u2013791 (1990)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Uji, K., Miwa, H.: Method for finding protected links to keep robust network against link failure considering failure probability. In: Proceedings of International Conference on Intelligent Networking and Collaborative System (INCoS2017), Toronto, Canada, 24\u201326 August 2017","DOI":"10.1007\/978-3-319-65636-6_37"},{"key":"29_CR17","unstructured":"CAIDA. http:\/\/www.caida.org\/"}],"container-title":["Lecture Notes on Data Engineering and Communications Technologies","Advances in Intelligent Networking and Collaborative Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98557-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T07:37:17Z","timestamp":1661845037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98557-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,26]]},"ISBN":["9783319985565","9783319985572"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98557-2_29","relation":{},"ISSN":["2367-4512","2367-4520"],"issn-type":[{"type":"print","value":"2367-4512"},{"type":"electronic","value":"2367-4520"}],"subject":[],"published":{"date-parts":[[2018,8,26]]},"assertion":[{"value":"INCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Networking and Collaborative Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incos2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}