{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:54:59Z","timestamp":1725573299789},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343752"},{"type":"electronic","value":"9783540343783"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_13","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"105-114","source":"Crossref","is-referenced-by-count":6,"title":["Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edda","family":"Happ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/316188.316209","volume-title":"Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication","author":"N.G. Duffield","year":"1999","unstructured":"Duffield, N.G., Goyal, P., Greenberg, A., Mishra, P., Ramakrishnan, K.K., van der Merive, J.E.: A flexible model for resource management in virtual private networks. In: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, pp. 95\u2013108. ACM Press, New York (1999)"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1006\/jagm.1997.0866","volume":"24","author":"J.A. Fingerhut","year":"1997","unstructured":"Fingerhut, J.A., Suri, S., Turner, J.S.: Designing least-cost nonblocking broadband networks. Journal of Algorithms\u00a024(2), 287\u2013309 (1997)","journal-title":"Journal of Algorithms"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Gupta, A., Kleinberg, J., Kumar, A., Rastogi, R., Yener, B.: Provisioning a virtual private network: a network design problem for multicommodity flow, pp. 389\u2013398 (2001)","DOI":"10.1145\/380752.380830"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/11496915_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"C. Hurkens","year":"2005","unstructured":"Hurkens, C., Keijsper, J., Stougie, L.: Virtual private network design: A proof of the tree routing conjecture on ring networks. In: J\u00fcnger, M., Kaibel, V. (eds.) IPCO 2005. LNCS, vol.\u00a03509, pp. 407\u2013421. Springer, Heidelberg (2005)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Erlebach, T., Regg, M.: Optimal bandwidth reservation in hose-model vpns with multi-path routing. In: INFOCOM (2004)","DOI":"10.1109\/INFCOM.2004.1354650"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Altin, A., Amaldi, E., Belotti, P., Pinar, M.: Provisioning virtual private networks under traffic uncertainty. In: Proceedings of the 3rd Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW 2004). Electronic Notes in Discrete Mathematics, vol.\u00a017, pp. 19\u201322 (2004)","DOI":"10.1016\/j.endm.2004.03.007"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1145\/780542.780597","volume-title":"Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. In: ACM (ed.) Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9\u201311, pp. 365\u2013372. ACM Press, New York (2003)"},{"key":"13_CR8","unstructured":"Eisenbrand, F., Grandoni, F.: An improved approximation algorithm for virtual private network design. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, SODA 2005, pp. 928\u2013932 (2005)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Grandoni, F., Oriolo, G., Skutella, M.: New approaches for virtual private network design. In: Proceedings of ICALP 2005 (to appear)","DOI":"10.1007\/11523468_93"},{"key":"13_CR10","unstructured":"Italiano, G., Leonardi, S., Oriolo, G.: Design of networks in the hose model. In: Proceedings of ARACNE 2002, pp. 65\u201376 (2002)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-52292-1_14","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"G. Reich","year":"1990","unstructured":"Reich, G., Widmayer, P.: Beyond Steiner\u2019s problem: A VLSI oriented generalization. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 196\u2013210. Springer, Heidelberg (1990)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Ihler, E.: The complexity of approximating the class Steiner tree problem. Technical report, Institut f\u00fcr Informatik, Albert-Ludwigs-Universit\u00e4t Freiburg (1991)","DOI":"10.1007\/3-540-55121-2_8"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. In: Proc. of the ACM sympository on the Theory of Computing, pp. 314\u2013318 (1996)","DOI":"10.1145\/237814.237977"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T16:12:07Z","timestamp":1683475927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11758471_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}