Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

How to Pack Your Items When You Have to Buy Your Knapsack


Ott,  Sebastian
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Antoniadis, A., Huang, C.-C., Ott, S., & Verschae, J. (2013). How to Pack Your Items When You Have to Buy Your Knapsack. In K. Chatterjee, & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013 (pp. 62-73). Berlin: Springer. doi:10.1007/978-3-642-40313-2_8.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0015-3B54-9
In this paper we consider a generalization of the classical knapsack problem. While in the standard setting a fixed capacity may not be exceeded by the weight of the chosen items, we replace this hard constraint by a weight-dependent cost function. The objective is to maximize the total profit of the chosen items minus the cost induced by their total weight. We study two natural classes of cost functions, namely convex and concave functions. For the concave case, we show that the problem can be solved in polynomial time; for the convex case we present an FPTAS and a 2-approximation algorithm with the running time of \mathcalO(n \log n), where n is the number of items. Before, only a 3-approximation algorithm was known. We note that our problem with a convex cost function is a special case of maximizing a non-monotone, possibly negative submodular function.