![NP-complete problems / Travelling salesman problem / Matching / Eulerian path / Hamiltonian path / Christofides algorithm / Connectivity / Graph / Graph theory / Mathematics / Theoretical computer science NP-complete problems / Travelling salesman problem / Matching / Eulerian path / Hamiltonian path / Christofides algorithm / Connectivity / Graph / Graph theory / Mathematics / Theoretical computer science](https://www.pdfsearch.io/img/ecbc5e7ebc2fae2b2a9871039637f404.jpg)
| Document Date: 2007-10-28 15:28:40 Open Document File Size: 53,50 KBShare Result on Facebook
Facility Carnegie Mellon University / / IndustryTerm approximation algorithm / / Organization Carnegie Mellon University / Industrial Administration / Graduate School / / Position salesman / / ProgrammingLanguage TSP / / Technology approximation algorithm / /
SocialTag |