{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:07:34Z","timestamp":1730268454843,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5062266","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T15:10:14Z","timestamp":1244041814000},"page":"2956-2960","source":"Crossref","is-referenced-by-count":1,"title":["Shadow Prices vs. Vickrey Prices in Multipath Routing"],"prefix":"10.1109","author":[{"given":"P.","family":"Ramanujam","sequence":"first","affiliation":[{"name":"Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Z.","family":"Li","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Higham","sequence":"additional","affiliation":[{"name":"Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"13"},{"key":"14","doi-asserted-by":"crossref","first-page":"2467","DOI":"10.1109\/TIT.2006.874515","article-title":"on achieving optimal multicast throughput in undirected networks","volume":"52","author":"li","year":"2006","journal-title":"IEEE Transactions on Information Theory"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1064009.1064032"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.35"},{"journal-title":"Combinatorial Optimization Algorithms and Complexity","year":"1998","author":"papadimitriou","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1038\/sj.jors.2600523"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815297"},{"year":"0","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959899"},{"key":"5","article-title":"truthful multicast in selfish wireless networks","author":"wang","year":"2004","journal-title":"Proceedings of ACM MOBICOM"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.2307\/2977633"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2006.1666512"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.69"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","start":{"date-parts":[[2009,4,19]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05062266.pdf?arnumber=5062266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T18:21:48Z","timestamp":1677781308000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5062266\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5062266","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}