\usepackage[letterpaper,left=2.6cm,right=2.6cm,top=2.6cm,bottom=2.6cm]{geometry}
-\usepackage{floatflt}
\usepackage{pstricks}
\usepackage{delarray}
one or more of the nodes $p^t_j$ to the sink to represent a review
by reviewer $i$ of paper $j$.
-Each paper has an edge of capacity $r$ to
-the sink, indicating that it needs $r$ reviews. In general, these
+Each paper has an edge of capacity $q$ to
+the sink, indicating that it needs $q$ reviews. In general, these
edges will constitute the min cut, so any max flow will saturate them
and thereby provide all the required reviews. We take the min-cost
max flow in order to provide the reviews in the ``best'' possible way.
In addition to the bonus edges,
there are edges of zero cost and unlimited capacity that reviews can follow
from $p^1_j$ to $p^2_j$ and from $p^2_j$ to $p^3_j$ in order to reach the sink.
-The choice to offer bonuses for two reviews was based on the value $r = 3$;
-this would be easy to change for other values of $r$.
+The choice to offer bonuses for two reviews was based on the value $q = 3$;
+this would be easy to change for other values of $q$.
In the example in Figure~\ref{flow-fig},
paper 1 is interesting to reviewer 1 and boring to reviewers 2 and 3.