\documentstyle[11pt,handout]{article}
\begin{document}
\input{macros}
\input{/home/rraj/Courses/3390/S99/macros/localmacros}
\thispagestyle{empty}
\setlength{\parindent}{0pt}
\setlength{\parskip}{1.8ex}

\head{3390}{Analysis of Algorithms}{Spring 1999}{19 May 1999}{20}

\begin{center}
\Large{\bf Problem of the Week -- 8}
\end{center}

Given a weighted directed graph $G = (V, E)$, a source $s \in V$, a
destination $t \in V$, and an integer $k$, design and analyze an efficient
algorithm to determine the shortest path (if it exists) from $s$ to $t$
containing at most $k$ edges.

\end{document}