A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility

First Page		Document Content
Date: 2015-04-08 19:35:45 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 Source URL: tandy.cs.illinois.edu Download Document from Source Website File Size: 328,92 KB Share Document on Facebook