First Page | Document Content | |
---|---|---|
![]() Date: 2005-12-05 15:22:50Complexity classes NP-complete problems Approximation algorithms Operations research Travelling salesman problem Polynomial-time approximation scheme APX Optimization problem NP Theoretical computer science Computational complexity theory Applied mathematics | Source URL: graphics.stanford.eduDownload Document from Source WebsiteFile Size: 270,32 KBShare Document on Facebook |