Asset Details
Do you wish to reserve the book?
A Faster FPTAS for the Unbounded Knapsack Problem
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Faster FPTAS for the Unbounded Knapsack Problem
Do you wish to request the book?
A Faster FPTAS for the Unbounded Knapsack Problem
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
A Faster FPTAS for the Unbounded Knapsack Problem
2015
Overview
The Unbounded Knapsack Problem (UKP) is a well-known variant of the famous 0-1 Knapsack Problem (0-1 KP). In contrast to 0-1 KP, an arbitrary number of copies of every item can be taken in UKP. Since UKP is NP-hard, fully polynomial time approximation schemes (FPTAS) are of great interest. Such algorithms find a solution arbitrarily close to the optimum \\(OPT(I)\\), i.e. of value at least \\((1-) OPT(I)\\) for \\( > 0\\), and have a running time polynomial in the input length and \\(1\\). For over thirty years, the best FPTAS was due to Lawler with a running time in \\(O(n + 1^3)\\) and a space complexity in \\(O(n + 1^2)\\), where \\(n\\) is the number of knapsack items. We present an improved FPTAS with a running time in \\(O(n + 1^2 ^3 1)\\) and a space bound in \\(O(n + 1 ^2 1)\\). This directly improves the running time of the fastest known approximation schemes for Bin Packing and Strip Packing, which have to approximately solve UKP instances as subproblems.
Publisher
Cornell University Library, arXiv.org
