{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:25:11Z","timestamp":1787505911660,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374440","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T12:50:20Z","timestamp":1211979020000},"page":"443-450","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["The VPN conjecture is true"],"prefix":"10.1145","author":[{"given":"Navin","family":"Goyal","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil","family":"Olver","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, PQ, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F B.","family":"Shepherd","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, PQ, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v49:1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/777313.777314"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.4.769"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00016-4"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00427-3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1324215.1324236"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v50:1"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316209"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354650"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0866"},{"key":"e_1_3_2_1_13_1","volume-title":"a, and D. O. Theis. The VPN tree routing conjecture for outerplanar networks. Submitted manuscript","author":"Fiorini S.","year":"2007","unstructured":"S. Fiorini , G. Oriolo , L. Sanit ` a, and D. O. Theis. The VPN tree routing conjecture for outerplanar networks. Submitted manuscript , 2007 . S. Fiorini, G. Oriolo, L. Sanit`a, and D. O. Theis. The VPN tree routing conjecture for outerplanar networks. Submitted manuscript, 2007."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.10.008"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380830"},{"key":"e_1_3_2_1_16_1","volume-title":"Private communication","author":"Gupta A.","year":"2001","unstructured":"A. Gupta and A. Kumar . Private communication , 2001 . A. Gupta and A. Kumar. Private communication, 2001."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496915_30"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.09.005"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863978"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of HotNets III","author":"Kodialam M.","year":"2004","unstructured":"M. Kodialam , T. V. Lakshman , and S. Sengupta . Efficient and robust routing of highly variable traffic . In Proc. of HotNets III , 2004 . M. Kodialam, T. V. Lakshman, and S. Sengupta. Efficient and robust routing of highly variable traffic. In Proc. of HotNets III, 2004."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. of INOC","author":"Lemarechal C.","year":"2005","unstructured":"C. Lemarechal , A. Ouorou , and G. Petrou . Robust network design in telecommunications . In Proc. of INOC , 2005 . C. Lemarechal, A. Ouorou, and G. Petrou. Robust network design in telecommunications. In Proc. of INOC, 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/31846.42226"},{"key":"e_1_3_2_1_24_1","volume-title":"Lucent Technical Memorandum ITD--04--45867F","author":"Nagesh H.","year":"2004","unstructured":"H. Nagesh , V. Poosala , S. Sengupta , M. Alicherry , and V. Kumar . Netswitch: Load--balanced data--over--optical architecture for mesh networks. Technical report , Lucent Technical Memorandum ITD--04--45867F , 2004 . H. Nagesh, V. Poosala, S. Sengupta, M. Alicherry, and V. Kumar. Netswitch: Load--balanced data--over--optical architecture for mesh networks. Technical report, Lucent Technical Memorandum ITD--04--45867F, 2004."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652152"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1204749"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of HotNets III","author":"Shen R. Z.","year":"2004","unstructured":"R. Z. Shen and N. Mckeown . Designing a predictable internet backbone network . In Proc. of HotNets III , 2004 . R. Z. Shen and N. Mckeown. Designing a predictable internet backbone network. In Proc. of HotNets III, 2004."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1364\/JON.5.000320"},{"key":"e_1_3_2_1_29_1","first-page":"566","volume-title":"Proc. of IEEE INFOCOM","author":"Widjaja I.","year":"2003","unstructured":"I. Widjaja and A. I. Elwalid . Exploiting parallelism to boost data--path rate in high--speed IP\/MPLS networking . In Proc. of IEEE INFOCOM , pages 566 -- 575 , 2003 . I. Widjaja and A. I. Elwalid. Exploiting parallelism to boost data--path rate in high--speed IP\/MPLS networking. In Proc. of IEEE INFOCOM, pages 566--575, 2003."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1049\/cp:20050360"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374440","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:57:49Z","timestamp":1750240669000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":30,"alternative-id":["10.1145\/1374376.1374440","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374440","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}