\begin{thebibliography}{1}

\bibitem{goldberg92}
R.~K. Ahuja, A.~V. Goldberg, J.~B. Orlin, and R.~E. Tarjan.
\newblock Finding minimum-cost flows by double scaling.
\newblock {\em Math. Program.}, 53(3):243--266, 1992.

\bibitem{lee61}
C.~Lee.
\newblock An algorithm for path connections and its applications.
\newblock {\em IRE Transactions on Electronic Computers}, EC-10(2):364--265,
  1961.

\bibitem{lengauer90}
T.~Lengauer.
\newblock {\em Combinatorial algorithms for integrated circuit layout}.
\newblock John Wiley \& Sons, Inc., New York, NY, USA, 1990.

\bibitem{motwani95}
R.~Motwani and P.~Raghavan.
\newblock {\em Randomized algorithms}.
\newblock Cambridge University Press, New York, NY, USA, 1995.

\bibitem{raghavan86}
P.~Raghavan.
\newblock {\em Randomized rounding and discrete ham-sandwich theorems: provably
  good algorithms for routing and packing problems (integer programming)}.
\newblock PhD thesis, University of California at Berkeley, 1986.

\bibitem{raghavan87}
P.~Raghavan and C.~D. Thompson.
\newblock Randomized rounding: A technique for provably good algorithms and
  algorithmic proofs.
\newblock {\em Combinatorica}, 7(4):365--374, 1987.

\bibitem{urbanski06}
J.~Urbanksi, W.~Thies, C.~Rhodes, S.~Amarasinghe, and T.~Thorsen.
\newblock Digital microfluidics using soft litography.
\newblock {\em Lab on a Chip}, 6(1):96--104, 2006.

\bibitem{xiang03}
H.~Xiang, X.~Tang, and D.~F. Wong.
\newblock Min-cost flow-based algorithm for simultaneous pin assignment and
  routing.
\newblock {\em IEEE Transactions on Computer-Aided Design of Integrated
  Circuits and Systems}, 22(7):870--878, July 2003.

\end{thebibliography}
