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)

Related topics

Related topics

14 relations
AlgorithmApproximation algorithmDegree (graph theory)Handshaking lemma

Broader (2)

Spanning treeTravelling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
SOS on SNS: Adolescent distress on social network sites
  • Yaakov Ophir
  • Computers in Human Behavior
  • 2017
  • Corpus ID: 32814135
2015
2015
Capacitated p-center problem with failure foresight
2015
2015
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant of the well-known… 
2012
2012
Improving christofides' algorithm for the s-t path TSP
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
Improving Christofides' Algorithm for the s-t Path TSP
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
Spatio-Temporal Modeling of Nonlinear Distributed Parameter Systems
This chapter is an introduction of the book. Starting from typical examples of distributed parameter systems (DPS) encountered in… 
2009
2009
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Highly Cited
2002
Highly Cited
2002
Analysis of Christofides ' heuristic : Some paths are more difficult than cycles
  • 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
1984
On Two Geometric Problems Related to the Traveling Salesman Problem
Highly Cited
1982
Highly Cited
1982
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)