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.
Review
2018
Review
2018
Is There Really a Foreign Language Premium in Canada?: Evaluating the Foreign Language Effect on Canadian Wages
Given the debates on whether knowing a foreign language has a positive or negative effect on wages, there is little or no… 
2017
2017
On time-optimal behavior scheduling of robotic swarms for achieving multiple goals
Robotic swarms are multi-robot systems whose global behaviors emerge from local interactions between individual robots. Each… 
2017
2017
Safe Model Predictive Control Formulations Ensuring Process Operational Safety - eScholarship
Model predictive control (MPC) is an advanced control strategy widely used in the process industries and beyond. Therefore… 
2016
2016
An Approximation Approach for Solving the Subpath Planning Problem
The subpath planning problem is a branch of the path planning problem, which has widespread applications in automated… 
2013
2013
A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem
Understanding the behaviour of well-known algorithms for classical NP-hard optimisation problems is still a difficult task. With… 
2013
2013
(1, 2)-Hamiltonian Completion on a Matching
We consider the problem of computing a minimum-weight Hamiltonian cycle on an undirected graph with edges' weights from set {0, 1… 
2009
2009
Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity
1983
1983
An extension of Christofides heuristic to the k-person travelling salesman problem
1973
1973
An Algorithm for Determining the Chromatic Number of a Graph
A heuristic algorithm for the determination of the chromatic number of a finite graph is presented. This algorithm is based on… 
1972
1972
Application of the Loading Algorithm to Balance Workloads
Abstract The Eilon-Christofides algorithm for the loading problem is modified to allocate n jobs of given magnitude to m… 
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)