{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:13:01Z","timestamp":1761621181696},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T00:00:00Z","timestamp":1409270400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s00453-014-9927-z","type":"journal-article","created":{"date-parts":[[2014,8,28]],"date-time":"2014-08-28T14:12:22Z","timestamp":1409235142000},"page":"718-731","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["The Minimum Vulnerability Problem"],"prefix":"10.1007","volume":"70","author":[{"given":"Sepehr","family":"Assadi","sequence":"first","affiliation":[]},{"given":"Ehsan","family":"Emamjomeh-Zadeh","sequence":"additional","affiliation":[]},{"given":"Ashkan","family":"Norouzi-Fard","sequence":"additional","affiliation":[]},{"given":"Sadra","family":"Yazdanbod","sequence":"additional","affiliation":[]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,29]]},"reference":[{"key":"9927_CR1","doi-asserted-by":"crossref","unstructured":"Assadi, S., Emamjomeh-Zadeh, E., Norouzi-Fard, A., Yazdanbod, S., Zarrabi-Zadeh, H.: The minimum vulnerability problem. In: Proceedings of the 23rd International Symposium on Algorithms and Computation, Volume 7676 of Lecture Notes in Computer Science, pp. 382\u2013391 (2012)","DOI":"10.1007\/978-3-642-35261-4_41"},{"key":"9927_CR2","unstructured":"Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, pp. 106\u2013115 (2000)"},{"key":"9927_CR3","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Chekuri, C., Khanna, S., Korula, N.: Approximability of capacitated network design. In: Proceedings of the 15th International Conference on Integer Programming and Combinatoral Optimization, Volume 6655 of Lecture Notes in Computer Science, pp. 78\u201391 (2011)","DOI":"10.1007\/978-3-642-20807-2_7"},{"key":"9927_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Krishnaswamy, R., Li, S., Narayanan, S.: Capacitated network design on undirected graphs. In: Proceedings of the 16th International Workshop on Approximation Algorithms, Volume 8096 of Lecture Notes in Computer Science, pp. 71\u201380 (2013)","DOI":"10.1007\/978-3-642-40328-6_6"},{"issue":"1","key":"9927_CR5","doi-asserted-by":"crossref","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 1(1), 74\u2013101 (2005)","journal-title":"ACM Trans. Algorithms"},{"key":"9927_CR6","unstructured":"Franklin, M.K.: Complexity and security of distributed protocols. Ph.D. thesis, Depatment of Computer Science, Columbia University (1994)"},{"key":"9927_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)"},{"key":"9927_CR8","doi-asserted-by":"crossref","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","DOI":"10.1006\/jagm.2000.1096"},{"issue":"5","key":"9927_CR9","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"AV Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM 45(5), 783\u2013797 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"9927_CR10","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"AV Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM 35(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"9927_CR11","unstructured":"Hajiaghayi, M., Khandekar, R., Kortsarz, G., Nutov, Z.: On the fixed cost $$k$$ k -flow problem and related problems. arXiv:1108.1176 (2011)"},{"issue":"3","key":"9927_CR12","doi-asserted-by":"crossref","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 Struct. Algorithms 20(3), 465\u2013482 (2002)","journal-title":"Random Struct. Algorithms"},{"key":"9927_CR13","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: Proceedings of the International Conference on Operation Research: OR-98, pp. 158\u2013167 (1998)","DOI":"10.1007\/978-3-642-58409-1_15"},{"issue":"4","key":"9927_CR14","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s10878-012-9462-2","volume":"26","author":"MT Omran","year":"2013","unstructured":"Omran, M.T., Sack, J.-R., Zarrabi-Zadeh, H.: Finding paths with minimum shared edges. J. Comb. Optim. 26(4), 709\u2013722 (2013)","journal-title":"J. Comb. Optim."},{"issue":"9","key":"9927_CR15","doi-asserted-by":"crossref","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. 55(9), 1130\u20131141 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"9927_CR16","unstructured":"Yang, B., Yang, M., Wang, J., Zheng, S.Q.: Minimum cost paths subject to minimum vulnerability for reliable communications. In: Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 334\u2013339. IEEE Computer Society (2005)"},{"issue":"5","key":"9927_CR17","doi-asserted-by":"crossref","first-page":"1436","DOI":"10.1109\/TNET.2010.2044514","volume":"18","author":"SQ 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. Netw. 18(5), 1436\u20131449 (2010)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9927-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-014-9927-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-014-9927-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T08:00:36Z","timestamp":1565769636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-014-9927-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,29]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9927"],"URL":"https:\/\/doi.org\/10.1007\/s00453-014-9927-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,29]]}}}