Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,094,152 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.
Review
2018
Review
2018
Is There Really a Foreign Language Premium in Canada?: Evaluating the Foreign Language Effect on Canadian Wages
Peter C Ki
2018
Corpus ID: 158273845
Given the debates on whether knowing a foreign language has a positive or negative effect on wages, there is little or no…
Expand
2018
2018
Optimisation of stock keeping unit placement in a retail distribution centre
Shane Andrew van Heerden
,
J. V. van Vuuren
2018
Corpus ID: 56403007
The retail problem of slotting refers to the assignment of stock keeping units (SKUs) to the available storage locations in a…
Expand
2018
2018
J an 2 01 8 Approaching 3 2 for the s-t-path TSP 1
Vera Traub
,
J. Vygen
2018
Corpus ID: 21392793
We show that there is a polynomial-time algorithm with approximation guarantee 3 2 + ε for the s-t-path TSP, for any fixed ε > 0…
Expand
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
2013
2013
(1, 2)-Hamiltonian Completion on a Matching
Marcin Bienkowski
,
Paweł 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
2010
2010
Metode Kontruksi Dan Aproksimasi Dengan Algoritma Christofides Heuristic Pada Permasalahan Traveling Salesman Problem
D. Rahmawati
2010
Corpus ID: 116094760
2010
2010
Algorithmic Approaches for Solving Hard Problems Approximation and Complexity
2010
Corpus ID: 55680607
In this dissertation, we study approaches beyond classical approximation for solving hard problems. The use of these approaches…
Expand
2009
2009
Algorithmic Approaches for Solving Hard Problems: Approximation and Complexity
Tobias Mömke
2009
Corpus ID: 211015733
2008
2008
A Bound for Metric Traveling Salesman Problem under Christofides' Algorithm
Xiao-Fei Ye
2008
Corpus ID: 124237957
For the metric TSP(Traveling Salesman Problem),there are many algorithms.It is known that the bound based on Christofides…
Expand
2006
2006
On cost matrices with two and three distinct values of Hamiltonian paths and cycles
S. Kabadi
,
Abraham P. Punnen
SIAM Journal on Discrete Mathematics
2006
Corpus ID: 15995892
A polynomial time testable characterization of cost matrices associated with a complete digraph on $n$ nodes such that all the…
Expand