{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:12Z","timestamp":1759638792411},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_93","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"1151-1162","source":"Crossref","is-referenced-by-count":15,"title":["New Approaches for Virtual Private Network Design"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Eisenbrand","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Grandoni","sequence":"additional","affiliation":[]},{"given":"Gianpaolo","family":"Oriolo","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"93_CR1","first-page":"40","volume-title":"Proceedings of the 39th Annual Symposium on Foundations of Computer Science(FOCS 1998)","author":"M. Andrews","year":"1998","unstructured":"Andrews, M., Zhang, L.: The access network design problem. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science(FOCS 1998), November 8\u201311, pp. 40\u201349. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"93_CR2","first-page":"20","volume-title":"38th Annual Symposium on Foundations of Computer Science","author":"B. Awerbuch","year":"1997","unstructured":"Awerbuch, B., Azar, Y.: Buy-at-bulk network design. In: 38th Annual Symposium on Foundations of Computer Science, Miami Beach, Florida, October 1997, pp. 20\u201322. IEEE, Los Alamitos (1997)"},{"issue":"4","key":"93_CR3","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/S0895480100368189","volume":"14","author":"G. Brightwell","year":"2001","unstructured":"Brightwell, G., Oriolo, G., Shepherd, F.B.: Reserving resilient capacity in a network. SIAM J. Discrete Math.\u00a014(4), 524\u2013539 (2001)","journal-title":"SIAM J. Discrete Math."},{"key":"93_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks\u00a01, 195\u2013207 (1971- 1972)","journal-title":"Networks"},{"key":"93_CR5","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)"},{"key":"93_CR6","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)"},{"issue":"4","key":"93_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing\u00a05(4), 691\u2013703 (1976)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"93_CR8","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":"93_CR9","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. In: ACM Symposium on the Theory of Computing, pp. 389\u2013398 (2001)","DOI":"10.1145\/380752.380830"},{"key":"93_CR10","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-11, pp. 365\u2013372. ACM Press, New York (2003)"},{"key":"93_CR11","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/opre.11.3.344","volume":"11","author":"T. Hu","year":"1963","unstructured":"Hu, T.: Multi-commodity network flows. Operations Research\u00a011, 344\u2013360 (1963)","journal-title":"Operations Research"},{"key":"93_CR12","doi-asserted-by":"crossref","unstructured":"Hurkens, C., Keijsper, J., Stougie, L.: Virtual private network design: A proof of the tree routing conjecture on ring networks. In: Proceedings of the eleventh Conference on Integer Programming and Combinatorial Optimization, IPCO XI (2005) (to appear)","DOI":"10.1007\/11496915_30"},{"key":"93_CR13","unstructured":"Italiano, G., Leonardi, S., Oriolo, G.: Design of networks in the hose model. In: Proceedings of ARACNE 2002, pp. 65\u201376 (2002)"},{"key":"93_CR14","first-page":"131","volume-title":"Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM 2002)","author":"G.F. Italiano","year":"2002","unstructured":"Italiano, G.F., Rastogi, R., Yener, B.: Restoration algorithms for virtual private networks in the hose model. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Society (INFOCOM 2002), vol.\u00a01, pp. 131\u2013139. IEEE Computer Society, Los Alamitos (2002)"},{"key":"93_CR15","unstructured":"Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: Proceedings of the eleventh annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000, pp. 770\u2013779 (2000)"},{"key":"#cr-split#-93_CR16.1","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency, vol. 3 (2003);"},{"key":"#cr-split#-93_CR16.2","unstructured":"Algorithms and Combinatorics, vol. 24. Springer, Berlin"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:47:11Z","timestamp":1619506031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11523468_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}