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).
A Clustering Scheme for Hierarchical Routing in Wireless Networks. Suman Banerjee. Samir Khuller. February 2000. Department of Computer Science, University of Maryland.
The Full Degree Spanning Tree Problem. Randeep Bhatia. Samir Khuller. Robert Pless. Yoram Sussmann. October 1998. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland.
Improved Methods for Approximating Node Weighted Steiner Trees and. Sudipto Guha. Samir Khuller. December 1997. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland.
Algorithms for Capacitated Vehicle Routing. Moses Charikar. Samir Khuller. Balaji Raghavachari. November 1997. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland.
Facility Location with Dynamic Distance Functions. . Randeep Bhatia. Sudipto Guha. Samir Khuller. Yoram J. Sussmann. October 1997. University of Maryland Institute for Advanced Computer Studies. Department of Computer Science, University of Maryland.
Approximation Algorithms for Connected Dominating Sets. Sudipto Guha. Samir Khuller. June 1996. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
The Loading Time Scheduling Problem. Randeep Bhatia. Samir Khuller. Joseph (Seffi) Naor. June 1996. Dept. of Computer Science, Univ. of Maryland.
Fault Tolerant K-Center Problems. Samir Khuller. Robert Pless. Yoram J. Sussmann. June 1996. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
The Capacitated K-Center Problem. Samir Khuller. Yoram J. Sussmann. June 1996. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
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.
Sandor P. Fekete. Samir Khuller. Monika Klemmstein. Balaji Raghavachari. Neal Young. A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning. December 1995. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Improved Approximation Algorthmsor Uniform Connectivity Problems. Samir Khuller. Balaji Raghavachari. February 1995. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Samir Khuller. Approximation Algorithms for Finding Highly Connected Subgraphs. January 1995. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Robert Freimer. Samir Khuller. Joe Mitchell. Christine Piatko. Kathleen Romanik. Diane Souvaine. October 1994. Localizing an object with finger probes. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Samir Khuller. Balaji Raghavachari. Azriel Rosenfeld. July 28, 1994. Localization in Graphs. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Samir Khuller. Balaji Raghavachari. Neal Young. January 1994. On Strongly Connected Digraphs with Bounded Cycle Length. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Samir Khuller. Balaji Raghavachari. Neal Young. January 1994. Low Degree Spanning Trees of Small Weight. 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.
Samir Khuller. Balaji Raghavachari. Neal Young. September 1993. Maintaining Directed Reachability with Few Edges. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Samir Khuller. August 1993. Design and Analysis of Algorithms: Course Notes. University of Maryland Institute for Advanced Computer Studies. Dept. of Computer Science, Univ. of Maryland.
Samir Khuller. Balaji Raghavachari. Neal Young. March 1993. Designing Multi-Commodity Flow Trees. 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