{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:15:32Z","timestamp":1743653732758,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_3","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"25-35","source":"Crossref","is-referenced-by-count":2,"title":["Notions of Connectivity in Overlay Networks"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Emek","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[]},{"given":"Amos","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Shay","family":"Kutten","sequence":"additional","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00130-9","volume":"250","author":"J. Bar-Ilan","year":"2001","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: Generalized submodular cover problems and applications. Theor. Comput. Sci.\u00a0250(1-2), 179\u2013200 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR2","unstructured":"Cisco IOS Software Releases 12.0 S. Mpls traffic engineering: Shared risk link groups (srlg), http:\/\/www.cisco.com\/en\/US\/docs\/ios\/12_0s\/feature\/guide\/fs29srlg.html"},{"key":"3_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press (2001)"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1142\/S0129626407002958","volume":"17","author":"D. Coudert","year":"2007","unstructured":"Coudert, D., Datta, P., Perennes, S., Rivano, H., Voge, M.-E.: Shared risk resource group: Complexity and approximability issues. Parallel Processing Letters\u00a017(2), 169\u2013184 (2007)","journal-title":"Parallel Processing Letters"},{"key":"3_CR5","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation. Soviet Math Doklady\u00a011, 1277\u20131280 (1970)","journal-title":"Soviet Math Doklady"},{"issue":"2","key":"3_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM\u00a019(2), 248\u2013264 (1972)","journal-title":"J. ACM"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TIT.1956.1056816","volume":"2","author":"P. Elias","year":"1956","unstructured":"Elias, P., Feinstein, A., Shannon, C.: A note on the maximum flow through a network. IEEE Transactions on Information Theory\u00a02(4), 117\u2013119 (1956)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"key":"3_CR9","unstructured":"Grotschel, M., Lovasz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization. Combinatorica (1981)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Hastad, J.: Clique is hard to approximate within n 1\u2009\u2212\u2009\u03b5 . In: IEEE Annual Symposium on Foundations of Computer Science, p. 627 (1996)","DOI":"10.1109\/SFCS.1996.548522"},{"key":"3_CR11","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison Wesley (2006)"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TNET.2010.2091426","volume":"19","author":"K. Lee","year":"2011","unstructured":"Lee, K., Modiano, E., Lee, H.-W.: Cross-layer survivability in wdm-based networks. IEEE\/ACM Transactions on Networking\u00a019(4), 1000\u20131013 (2011)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"95-115","key":"3_CR13","first-page":"5","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fund. Math.\u00a010(95-115), 5 (1927)","journal-title":"Fund. Math."},{"key":"3_CR14","unstructured":"Network Protection Website. Network protection techniques, network failure recovery, network failure events, http:\/\/www.network-protection.net\/shared-risk-link-group-srlg\/"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Ramamurthy, S., Mukherjee, B.: Survivable wdm mesh networks. part i-protection. In: Proceedings of IEEE Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1999, vol.\u00a02, pp. 744\u2013751 (March 1999)","DOI":"10.1109\/INFCOM.1999.751461"},{"key":"3_CR16","unstructured":"White Paper, Cisco Systems Inc. Policy-based routing (1996), http:\/\/www.cisco.com\/warp\/public\/cc\/pd\/iosw\/tech\/plicy_wp.pdf"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02579435","volume":"2","author":"L. Wolsey","year":"1982","unstructured":"Wolsey, L.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica\u00a02, 385\u2013393 (1982) 10.1007\/BF02579435","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T14:49:18Z","timestamp":1743605358000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}