1.1 --- a/lemon/cost_scaling.h	Thu Nov 12 23:49:05 2009 +0100
     1.2 +++ b/lemon/cost_scaling.h	Thu Nov 12 23:52:51 2009 +0100
     1.3 @@ -90,8 +90,10 @@
     1.4    /// finding a \ref min_cost_flow "minimum cost flow".
     1.5    ///
     1.6    /// \ref CostScaling implements a cost scaling algorithm that performs
     1.7 -  /// push/augment and relabel operations for finding a minimum cost
     1.8 -  /// flow. It is an efficient primal-dual solution method, which
     1.9 +  /// push/augment and relabel operations for finding a \ref min_cost_flow
    1.10 +  /// "minimum cost flow" \ref amo93networkflows, \ref goldberg90approximation,
    1.11 +  /// \ref goldberg97efficient, \ref bunnagel98efficient. 
    1.12 +  /// It is a highly efficient primal-dual solution method, which
    1.13    /// can be viewed as the generalization of the \ref Preflow
    1.14    /// "preflow push-relabel" algorithm for the maximum flow problem.
    1.15    ///