Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

14 relations
AlgorithmApproximation algorithmDegree (graph theory)Handshaking lemma
Expand

Broader (2)

Spanning treeTravelling salesman problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
2017
2017
SOS on SNS: Adolescent distress on social network sites
Psychological distress and experiences of peer victimization and social rejection are common among adolescents. Nevertheless, the… Expand
  • table 1
Highly Cited
2015
Highly Cited
2015
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2015
2015
Capacitated p-center problem with failure foresight
This paper deals with a generalized version of the capacitated p-center problem. The model takes into account the possibility… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2012
2012
A Probabilistic Analysis of Christofides' Algorithm
Christofides' algorithm is a well known approximation algorithm for the metric travelling salesman problem. As a first step… Expand
  • figure 1
  • figure 2
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
Highly Cited
2005
Highly Cited
2005
A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem
In this work we are concerned with the Clarke–Wright savings method for the classical capacitated vehicle routing problem. This… Expand
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… Expand
  • figure 1
Highly Cited
1995
Highly Cited
1995
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
The worst-case analyses of heuristics in combinatorial optimization are often far too pessimistic when confronted with… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE