{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:37:02Z","timestamp":1725457022820},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_41","type":"book-chapter","created":{"date-parts":[[2012,12,14]],"date-time":"2012-12-14T01:59:41Z","timestamp":1355450381000},"page":"382-391","source":"Crossref","is-referenced-by-count":3,"title":["The Minimum Vulnerability Problem"],"prefix":"10.1007","author":[{"given":"Sepehr","family":"Assadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehsan","family":"Emamjomeh-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashkan","family":"Norouzi-Fard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sadra","family":"Yazdanbod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 106\u2013115 (2000)"},{"issue":"1","key":"41_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1077464.1077470","volume":"1","author":"G. Even","year":"2005","unstructured":"Even, G., Kortsarz, G., Slany, W.: On network design problems: fixed cost flows and the covering steiner problem. ACM Trans. Algorithms\u00a01(1), 74\u2013101 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"41_CR3","unstructured":"Franklin, M.K.: Complexity and security of distributed protocols. PhD thesis, Dept. of Computer Science, Columbia University (1994)"},{"key":"41_CR4","unstructured":"Garey, M., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.H. Freeman (1979)"},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Garg, N., Ravi, R., Konjevod, G.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms\u00a037(1) (2000)","DOI":"10.1006\/jagm.2000.1096"},{"issue":"5","key":"41_CR6","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045(5), 783\u2013797 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"41_CR7","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1002\/rsa.10038","volume":"20","author":"G. Konjevod","year":"2002","unstructured":"Konjevod, G., Ravi, R., Srinivasan, A.: Approximation algorithms for the covering steiner problem. Random Structures & Algorithms\u00a020(3), 465\u2013482 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Krumke, S.O., Noltemeier, H., Schwarz, S., Wirth, H.-C., Ravi, R.: Flow improvement and network flows with fixed costs. In: Proc. Internat. Conf. Oper. Res.: OR 1998, pp. 158\u2013167 (1998)","DOI":"10.1007\/978-3-642-58409-1_15"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-642-22685-4_49","volume-title":"Computing and Combinatorics","author":"M.T. Omran","year":"2011","unstructured":"Omran, M.T., Sack, J.-R., Zarrabi-Zadeh, H.: Finding Paths with Minimum Shared Edges. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol.\u00a06842, pp. 567\u2013578. Springer, Heidelberg (2011)"},{"issue":"9","key":"41_CR11","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TC.2006.144","volume":"55","author":"J. Wang","year":"2006","unstructured":"Wang, J., Yang, M., Yang, B., Zheng, S.Q.: Dual-homing based scalable partial multicast protection. IEEE Trans. Comput.\u00a055(9), 1130\u20131141 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The design of approximation algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"41_CR13","unstructured":"Yang, B., Yang, M., Wang, J., Zheng, S.Q.: Minimum cost paths subject to minimum vulnerability for reliable communications. In: Proc. 8th Internat. Symp. Parallel Architectures, Algorithms and Networks, ISPAN 2005, pp. 334\u2013339. IEEE Computer Society (2005)"},{"issue":"5","key":"41_CR14","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1109\/TNET.2010.2044514","volume":"18","author":"S.Q. Zheng","year":"2010","unstructured":"Zheng, S.Q., Wang, J., Yang, B., Yang, M.: Minimum-cost multiple paths subject to minimum link and node sharing in a network. IEEE\/ACM Trans. Networking\u00a018(5), 1436\u20131449 (2010)","journal-title":"IEEE\/ACM Trans. Networking"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T20:25:35Z","timestamp":1687897535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}