Everything About ___
Live briefing

Everything about 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 Serdyukov. Christofides published the algorithm in 1976; Serdyukov discovered it independently in 1976 but published it in 1978. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Christofides algorithmA 5-minute orientation
  2. Skim a recent paper: Comparison of the Cheapest Insertion Heuristic Algorithm, Christofides Algorithm, and Nearest Neighbor Algorithm for Determining Hospital Tours in Bandar Lampung CityInfluential work since 2022
  3. Pick up a classic book: Graph theoryThe most-reprinted book on the subject
  4. Read the landmark paper: Improving Christofides' Algorithm for the s-t Path TSPCited 46 times
  5. Go sideways: Travelling salesman problemA closely related topic
  6. Go sideways: Approximation algorithmA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Algorithm
  2. Approximation ratio
  3. Lower bounds
  4. Example
  5. Further developments

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics