First Page | Document Content | |
---|---|---|
Date: 2014-10-22 08:43:20Graph theory Mathematics NP-complete problems NP-hard problems Operations research Travelling salesman problem Matching Eulerian path Hamiltonian path Minimum spanning tree Cycle Line graph | Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007Add to Reading ListSource URL: vigna.di.unimi.itDownload Document from Source WebsiteFile Size: 53,50 KBShare Document on Facebook |