{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:26:54Z","timestamp":1787495214268,"version":"build-2736575974"},"reference-count":6,"publisher":"IEEE","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1109\/sfcs.2002.1182006","type":"proceedings-article","created":{"date-parts":[[2005,8,24]],"date-time":"2005-08-24T23:23:34Z","timestamp":1124925814000},"page":"809-809","source":"Crossref","is-referenced-by-count":4,"title":["Erratum to \"Vickrey pricing and shortest paths: What is an edge worth?\""],"prefix":"10.1109","author":[{"given":"J.","family":"Hershberger","sequence":"first","affiliation":[{"name":"Mentor Graphics Corp."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"family":"Subhash Suri","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","author":"hershberger","year":"2002","journal-title":"On the difficulty of some shortest path problems Manuscript"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959899"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44679-6_31"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90065-5"},{"key":"ref2","article-title":"The complexity of finding most vital arcs and nodes","author":"bar-noy","year":"1995","journal-title":"Technical Report CS-TR-3539"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90003-5"}],"event":{"name":"Proceedings of 43rd Annual IEEE Symposium on Foundations of Computer Science","location":"Vancouver, BC, Canada","start":{"date-parts":[[2002,11,19]]},"end":{"date-parts":[[2002,11,19]]}},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01182006.pdf?arnumber=1182006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T13:57:48Z","timestamp":1748872668000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1182006\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1182006","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}