![Analysis of algorithms / Parameterized complexity / NP-complete problems / Kernelization / Time complexity / Vertex cover / Algorithm / Approximation algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics Analysis of algorithms / Parameterized complexity / NP-complete problems / Kernelization / Time complexity / Vertex cover / Algorithm / Approximation algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/b19665b7f6feaef7eef80246c1e46ac5.jpg)
| Document Date: 2012-12-29 15:19:34 Open Document File Size: 330,77 KBShare Result on Facebook
City Ottawa / / Company Vertex / / IndustryTerm search space / polynomial time algorithm / approximation algorithms / search problems / search algorithms / / Person David Sankoff / / Technology FPT algorithms / polynomial time algorithm / approximation algorithms / 2/2012 3 Background An FPT algorithm / bioinformatics / search algorithms / 2/2012 2 Background An FPT algorithm / /
SocialTag |