1.1 --- a/lemon/howard_mmc.h Sun Jan 29 22:33:14 2012 +0100
1.2 +++ b/lemon/howard_mmc.h Mon Jan 30 23:24:14 2012 +0100
1.3 @@ -98,7 +98,7 @@
1.4 ///
1.5 /// This class implements Howard's policy iteration algorithm for finding
1.6 /// a directed cycle of minimum mean cost in a digraph
1.7 - /// \ref amo93networkflows, \ref dasdan98minmeancycle.
1.8 + /// \ref dasdan98minmeancycle, \ref dasdan04experimental.
1.9 /// This class provides the most efficient algorithm for the
1.10 /// minimum mean cycle problem, though the best known theoretical
1.11 /// bound on its running time is exponential.