Back to Results
First PageMeta Content
Computational complexity theory / Theory of computation / Complexity classes / NP-complete problems / Combinatorial optimization / Packing problems / Approximation algorithms / Knapsack problem / NP / APX


A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility
Add to Reading List

Document Date: 2015-04-08 19:35:45

Open Document

File Size: 328,92 KB

Share Result on Facebook