You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format. However, this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the Department of Computer Science of the University of Maryland at College Park under terms that include this permission. All other rights are reserved by the author(s).
The Complexity of Finding Most Vital Arcs and Nodes. Amotz Bar-Noy. Samir Khuller. Baruch Schieber. November 1995. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Alok Aggarwal. Amotz Bar-Noy. Samir Khuller. Dina Kravets. Baruch Schieber. December 1993. Efficient Minimum Cost Matching and Transportation Using. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Last Generated Fri Aug 11 04:01:01 EDT 2000