Abstract
The 0-1 Knapsack optimization problem is well known to be NP-hard. The best known approximation algorithms for this problem are approximation schemes which exhibit trade-offs between the running time of the algorithm and the guaranteed accuracy of the solution. This paper establishes lower bounds on the time required to find approximate solutions of guaranteed accuracy for a class of knapsack algorithms which must use oracles to perform feasibility tests and dominance tests.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
