Keywords

#christofides_algorithm

Christofides algorithm

Approximation for the travelling salesman problem

The Christofides algorithm or Christofides–Serdyukov algorithm is an algorithm for finding approximate solutions to the travelling salesman problem, on instances where the distances form a metric space . It is an approximation algorithm that guarantees that its solutions will be within a factor of 3/2 of the optimal solution length, and is named after Nicos Christofides and Anatoliy I. Serdyukov ; the latter discovered it independently in 1976.

Mon 8th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Christofides algorithm Nicos Christofides Held–Karp algorithm Galactic algorithm List of algorithms Minimum spanning tree Travelling salesman problem List of terms relating to algorithms and data structures Cobham's thesis Vehicle routing problem
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.