1.1 --- a/lemon/christofides_tsp.h	Sun Jan 09 00:57:12 2011 +0100
     1.2 +++ b/lemon/christofides_tsp.h	Sun Jan 09 15:06:55 2011 +0100
     1.3 @@ -40,8 +40,9 @@
     1.4    ///
     1.5    /// This a well-known approximation method for the TSP problem with
     1.6    /// metric cost function.
     1.7 -  /// It yields a tour whose total cost is at most 3/2 of the optimum,
     1.8 -  /// but it is usually much better.
     1.9 +  /// It has a guaranteed approximation factor of 3/2 (i.e. it finds a tour
    1.10 +  /// whose total cost is at most 3/2 of the optimum), but it usually
    1.11 +  /// provides better solutions in practice.
    1.12    /// This implementation runs in O(n<sup>3</sup>log(n)) time.
    1.13    ///
    1.14    /// The algorithm starts with a \ref spantree "minimum cost spanning tree" and