COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
01/09/11 15:06:55 (9 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Make InsertionTsp? much faster and improve docs (#386)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/christofides_tsp.h

    r1202 r1204  
    4141  /// This a well-known approximation method for the TSP problem with
    4242  /// metric cost function.
    43   /// It yields a tour whose total cost is at most 3/2 of the optimum,
    44   /// but it is usually much better.
     43  /// It has a guaranteed approximation factor of 3/2 (i.e. it finds a tour
     44  /// whose total cost is at most 3/2 of the optimum), but it usually
     45  /// provides better solutions in practice.
    4546  /// This implementation runs in O(n<sup>3</sup>log(n)) time.
    4647  ///
Note: See TracChangeset for help on using the changeset viewer.