Approximation algorithms for minimum knapsack problem
Knapsack problem has been widely studied in computer science for years. There exist several variants of the problem, with zero-one maximum knapsack in one dimension being the simplest one. In this thesis we study several existing approximation algorithms for the minimization version of the proble...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Lethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science, c2009
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10133/1304 |