Skip to search formSkip to main contentSkip to account menu

Christofides algorithm

Known as: Christofides heuristic 
The Christofides algorithm is an algorithm for finding approximate solutions to the travelling salesman problem, on instances where the distances… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
  • Yaakov Ophir
  • Computers in Human Behavior
  • 2017
  • Corpus ID: 32814135
2015
2015
2015
2015
Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant of the well-known… 
2012
2012
We present a deterministic (1+√5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric… 
Highly Cited
2011
Highly Cited
2011
We present a deterministic (1+√5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric… 
Highly Cited
2011
Highly Cited
2011
This chapter is an introduction of the book. Starting from typical examples of distributed parameter systems (DPS) encountered in… 
2009
2009
Highly Cited
2002
Highly Cited
2002
  • A. J.
  • 2002
  • Corpus ID: 15324760
For the traveling salesman problem in which the distances satisfy the triangle inequality, Christofides' heuristic produces a… 
Highly Cited
1984
Highly Cited
1982