Knapsack FPTAS
Details
| Title | Knapsack FPTAS |
| Author | Computational Thinking |
| Duration | 10:52 |
| File Format | MP3 / MP4 |
| Original URL | https://youtube.com/watch?v=GyDTT3PxFP4 |
🎵 Support the artists — buy the original for the best audio quality! 🎵
Description
In this video, study the knapsack problem. We show that the NP-complete knapsack problem can be approximated arbitrarily well, and we present a fully polynomial time approximation scheme, or FPTas for short.
