Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,973,123 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Algorithm
Approximation algorithm
Degree (graph theory)
Handshaking lemma
Expand
Broader (2)
Spanning tree
Travelling 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
I. Espejo
,
Alfredo Marín
,
A. M. Rodríguez-Chía
European Journal of Operational Research
2015
Corpus ID: 10234203
2015
2015
An Experimental Evaluation of the Best-of-Many Christofides’ Algorithm for the Traveling Salesman Problem
Kyle Genova
,
David P. Williamson
Algorithmica
2015
Corpus ID: 11675442
Recent papers on approximation algorithms for the traveling salesman problem (TSP) have given a new variant of the well-known…
Expand
2012
2012
Improving christofides' algorithm for the s-t path TSP
Hyung-Chan An
,
Robert D. Kleinberg
,
D. Shmoys
Symposium on the Theory of Computing
2012
Corpus ID: 53223100
We present a deterministic (1+√5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric…
Expand
Highly Cited
2011
Highly Cited
2011
Improving Christofides' Algorithm for the s-t Path TSP
Hyung-Chan An
,
Robert D. Kleinberg
,
D. Shmoys
Journal of the ACM
2011
Corpus ID: 248550
We present a deterministic (1+√5/2)-approximation algorithm for the s-t path TSP for an arbitrary metric. Given a symmetric…
Expand
Highly Cited
2011
Highly Cited
2011
Spatio-Temporal Modeling of Nonlinear Distributed Parameter Systems
Han-Xiong Li
,
Chenkun Qi
2011
Corpus ID: 124511012
This chapter is an introduction of the book. Starting from typical examples of distributed parameter systems (DPS) encountered in…
Expand
2009
2009
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
E. Arkin
,
S. Fekete
,
+6 authors
Henry Xiao
Computational geometry
2009
Corpus ID: 13455714
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
Highly Cited
1984
Highly Cited
1984
On Two Geometric Problems Related to the Traveling Salesman Problem
C. Papadimitriou
,
U. Vazirani
J. Algorithms
1984
Corpus ID: 205084462
Highly Cited
1982
Highly Cited
1982
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems
G. Frederickson
,
J. JáJá
Theoretical Computer Science
1982
Corpus ID: 46716085
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)
ACCEPT & CONTINUE