Approximation algorithms for the weight-reducible knapsack problem

Goerigk, Marc and Sabharwal, Yogish and Schöbel, Anita and Sen, Sandeep (2014) Approximation algorithms for the weight-reducible knapsack problem. In: Theory and Applications of Models of Computation. TAMC 2014. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) . Springer, IND, pp. 203-215. ISBN 9783319060880

Full text not available from this repository.

Abstract

We consider the weight-reducible knapsack problem, where we are given a limited budget that can be used to decrease item weights, and we would like to optimize the knapsack objective value using such weight improvements. We develop a pseudo-polynomial algorithm for the problem, as well as a polynomial-time 3-approximation algorithm based on solving the LP-relaxation. Furthermore, we consider the special case of one degree of improvement with equal improvement costs for each item, and present a linear-time 3-approximation algorithm based on solving a cardinality-constrained and a classic knapsack problem, and show that the analysis of the polynomial-time 3-approximation algorithm can be improved to yield a 2-approximation.

Item Type:
Contribution in Book/Report/Proceedings
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2614
Subjects:
ID Code:
85511
Deposited By:
Deposited On:
15 Mar 2017 15:08
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Jan 2020 05:52