Christofides algorithm - PDFSEARCH.IO - Document Search Engine

Christofides algorithm
Results: 6

#	Item
1	FINDING HAMILTON CYCLES IN ROBUSTLY EXPANDING DIGRAPHS ¨ DEMETRES CHRISTOFIDES, PETER KEEVASH, DANIELA KUHN AND DERYK OSTHUS Abstract. We provide an NC algorithm for finding Hamilton cycles in directed graphs Add to Reading List Source URL: web.mat.bham.ac.uk Language: English - Date: 2012-05-08 05:46:03
2	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2014-10-22 08:43:20 Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph
3	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
4	Memetic Algorithms for the Traveling Salesman Problem Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-09-20 14:36:39 Travelling salesman problem Mathematical optimization Operations research Cybernetics Genetic algorithms Memetic algorithm Lin–Kernighan heuristic Greedy algorithm Christofides algorithm Mathematics Applied mathematics Theoretical computer science
5	Design and Analysis of Algorithms CS681 Fall 2007 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2007-10-28 15:28:40 NP-complete problems Travelling salesman problem Matching Eulerian path Hamiltonian path Christofides algorithm Connectivity Graph Graph theory Mathematics Theoretical computer science
6	Coping With NP-Hardness Approximation Algorithms Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2001-05-07 12:05:44 Operations research NP-complete problems Combinatorial optimization Approximation algorithms Travelling salesman problem Christofides algorithm Polynomial-time approximation scheme Optimization problem Knapsack problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE