Erratum: Vickrey pricing and shortest paths: What is an edge worth? (FOCS 2001 (2001) (257))

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 809-

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERRORS;

EID: 0036953983     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Erratum

References (6)

1. M. O. Ball, B. L. Golden, and R. V. Vohra, Finding the most vital arcs in a network. Oper. Res. Letters, 8: 73-76, 1989.
2. A. Bar-Noy, S. Khuller, and B. Schieber, The complexity of finding most vital arcs and nodes. Technical Report CS-TR-3539, Institute for Advanced Studies, Univ. Maryland, 1995.
3. J. Hershberger and S. Suri, Vickrey prices and shortest paths: What is an edge worth? In Proc. 42nd Annu. IEEE Symp. Found. Comput. Sci., pages 252-259, 2001.
4. J. Hershberger, S. Suri, and A. Bhosle. On the difficulty of some shortest path problems. Manuscript, 2002.
5. K. Malik, A. K. Mittal, and S. K. Gupta. The κ most vital arcs in the shortest path problem. Oper. Res. Letters, 8:223-227, 1989.
6. E. Nardelli, G. Proietti, and P. Widmayer. Finding the most vital node of a shortest path. In Proc. COCOON, 2001.