Opening book details…
About this Computer Science article
The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem by Liu is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Liu
- Publisher
- Springer; Springer-Verlag; Springer Verlag; Springer Science and Business Media LLC (ISSN 1433-0490)
- Published
- 2002
- Language
- EN
- Field
- Computer Science (Physical Sciences)