Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,361,938 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.
2018
2018
An improved upper bound on the integrality ratio for the s-t-path TSP
Vera Traub
,
J. Vygen
Operations Research Letters
2018
Corpus ID: 52145278
2017
2017
On time-optimal behavior scheduling of robotic swarms for achieving multiple goals
S. Nagavalli
,
N. Chakraborty
,
K. Sycara
CASE
2017
Corpus ID: 12360739
Robotic swarms are multi-robot systems whose global behaviors emerge from local interactions between individual robots. Each…
Expand
2017
2017
Parallelizing an exact algorithm for the traveling salesman problem
V. Burkhovetskiy
,
B. Y. Steinberg
2017
Corpus ID: 67197475
2017
2017
Safe Model Predictive Control Formulations Ensuring Process Operational Safety - eScholarship
Fahad Albalawi
2017
Corpus ID: 116240859
Model predictive control (MPC) is an advanced control strategy widely used in the process industries and beyond. Therefore…
Expand
2016
2016
Multi-Robot Patrolling in Wireless Sensor Networks Using Bounded Cycle Coverage
Mihai-Ioan Popescu
,
H. Rivano
,
Olivier Simonin
IEEE International Conference on Tools with…
2016
Corpus ID: 14210285
Patrolling is mainly used in situations where the need of repeatedly visiting certain places is critical. In this paper, we…
Expand
2013
2013
A feature-based comparison of local search and the christofides algorithm for the travelling salesperson problem
Samadhi Nallaperuma
,
Markus Wagner
,
F. Neumann
,
B. Bischl
,
Olaf Mersmann
,
H. Trautmann
FOGA XII '13
2013
Corpus ID: 4991990
Understanding the behaviour of well-known algorithms for classical NP-hard optimisation problems is still a difficult task. With…
Expand
2013
2013
(1, 2)-Hamiltonian Completion on a Matching
Marcin Bienkowski
,
P. Zalewski
International Journal of Foundations of Computer…
2013
Corpus ID: 3444636
We consider the problem of computing a minimum-weight Hamiltonian cycle on an undirected graph with edges' weights from set {0, 1…
Expand
2009
2009
Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity
Tobias Mömke
2009
Corpus ID: 211015733
1983
1983
An extension of Christofides heuristic to the k-person travelling salesman problem
A. Frieze
Discrete Applied Mathematics
1983
Corpus ID: 205053677
1973
1973
An Algorithm for Determining the Chromatic Number of a Graph
D. Corneil
,
B. P. Graham
SIAM journal on computing (Print)
1973
Corpus ID: 33820815
A heuristic algorithm for the determination of the chromatic number of a finite graph is presented. This algorithm is based on…
Expand
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