Approximate algorithms for survivable network design

研究成果: Conference contribution同行評審

摘要

Along with the rapid development of network communication technology and the explosive growth of the internet applications, network reliability appears increasingly important to both traditional areas such as defense, finance and power industry, and emerging areas such as trusted computing, cloud computing and next-generation Internet. An interesting subject that has attracted great effort is how to design network topologies with a minimum network resource usage in terms of cost that provides a relibility guarantee. As problems on this subject, like most other network optimization problems, are well-known NP-hard even in their simplest form, design of effective solutions with a guaranteed approximation ratio from the optimal solution has been a major research focus of great significance for both theory and applications. This survery summarizes major existing techniques and results for solving some central problems in designing survivable networks including the minimal connected subgraph problem, the survivable network design problem and the Steiner minimal network problem.

原文English
主出版物標題Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012
頁面9-18
頁數10
DOIs
出版狀態Published - 2012
對外發佈
事件2012 3rd International Conference on Networking and Computing, ICNC 2012 - Naha, Okinawa, Japan
持續時間: 5 12月 20127 12月 2012

出版系列

名字Proceedings of the 2012 3rd International Conference on Networking and Computing, ICNC 2012

Conference

Conference2012 3rd International Conference on Networking and Computing, ICNC 2012
國家/地區Japan
城市Naha, Okinawa
期間5/12/127/12/12

指紋

深入研究「Approximate algorithms for survivable network design」主題。共同形成了獨特的指紋。

引用此