First Page | Document Content | |
---|---|---|
Date: 2014-03-11 09:18:22Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics | Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation SchemesAdd to Reading ListSource URL: www.cs.bris.ac.ukDownload Document from Source WebsiteFile Size: 478,74 KBShare Document on Facebook |