\documentclass[12pt]{article}
\title{CS 141: Advanced Topics in Algorithms \\ Spring 2006 \\ Assignment Mac and Elisa}
\author{}
\date{Due: Tuesday, April 11}

\newcommand{\Points}[1]{\textbf{[#1 Points]}}
\newcommand{\Name}[1]{\textbf{#1}}

\begin{document}
\maketitle
\begin{enumerate}
\item \Points{X} \Name{FCFK is Tight!}

  In class, we saw that the \emph{First Come, First Kill} algorithm
  has a competitive ratio of $2N$ on the uniform metric space. Prove
  that this bound is tight.

\end{enumerate}
\end{document}
