Coping With NP-Hardness Approximation Algorithms

First Page		Document Content
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		Coping With NP-Hardness Approximation Algorithms Add to Reading List Source URL: www.cs.princeton.edu Download Document from Source Website File Size: 140,63 KB Share Document on Facebook

	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 DocID: 1n6tO - View Document
	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 DocID: 1mquF - View Document
	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) DocID: 18Med - View Document
	Memetic Algorithms for the Traveling Salesman Problem DocID: 18F7U - View Document
	Design and Analysis of Algorithms CS681 Fall 2007 DocID: 4FC6 - View Document