\documentclass[12pt]{article}

\usepackage{graphicx}
\usepackage{amsmath,amssymb,url}
\usepackage{bbm}
\usepackage{hyperref}

\newfont{\bssdoz}{cmssbx10 scaled 1200}
\newfont{\bssten}{cmssbx10}


\oddsidemargin  0in \evensidemargin 0in \topmargin -0.5in
\headheight 0.25in \headsep 0.25in
\textwidth   6.5in \textheight 9in %\marginparsep 0pt \marginparwidth 0pt
\parskip 1.5ex  \parindent 0ex \footskip 20pt

\begin{document}
\parindent 0ex
\thispagestyle{empty} \vspace*{-0.75in}
{\bssdoz CME 305: Discrete Mathematics and Algorithms}
{\\ \bssten Instructor: Professor John Tomlin (jtomlin5@stanford.edu) }
{\\ \bssten HW\#2 --  Due Thursday 01/14/13}
\vspace{5pt}

\begin{enumerate}

\item 
Consider the stable bipartite matching problem of Chapter 1 in KT - in particular the ``marriage problem''. Is it possible to formulate the problem as an optimization problem, e.g. by assigning cost values to the arcs $(m,w)$ in the complete bipartite graph? Prove it is possible or find a counter-example.
\item 
Solve Exercise 4, Chapter 1 in KT. (The med student --- hospital problem)
\end{enumerate}
\end{document}