Abstract
In this paper, we study the robustness over the cardinality variation for the knapsack problem. For the knapsack problem and a positive number α ≤ 1, we say that a feasible solution is α-robust if, for any positive integer k, it includes an α-approximation of the maximum k-knapsack solution, where a k-knapsack solution is a feasible solution that consists of at most k items.
In this paper, we show that, for any ε > 0, the problem of deciding whether the knapsack problem admits a (ν + ε)-robust solution is weakly NP-hard, where ν denotes the rank quotient of the corresponding knapsack system. Since the knapsack problem always admits a ν-robust knapsack solution [7], this result provides a sharp border for the complexity of the robust knapsack problem. On the positive side, we show that a max-robust knapsack solution can be computed in pseudo-polynomial time, and present a fully polynomial time approximation scheme (FPTAS) for computing a max-robust knapsack solution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Caprara, A., Kellerer, H., Pferschy, U., Pisinger, D.: Approximation algorithms for knapsack problems with cardinality constraints. European J. Oper. Res. 123, 333–345 (2000)
Dantzig, G.B.: Discrete-variable extremum problems. Ope. Res. 5, 266–277 (1957)
Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1, 127–136 (1971)
Fujita, R., Kobayashi, Y., Makino, K.: Robust Matchings and Matroid Intersections. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6347, pp. 123–134. Springer, Heidelberg (2010)
Fukunaga, T., Halldórsson, M., Nagamochi, H.: Robust cost colorings. In: Proc. SODA 2008, pp. 1204–1212 (2008)
Garey, M.R., Johnson, D.E.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Hassin, R., Rubinstein, S.: Robust matchings. SIAM J. Discrete Math. 15, 530–537 (2002)
Hassin, R., Segev, D.: Robust subgraphs for trees and paths. ACM Trans. Algorithms 2, 263–281 (2006)
Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. ACM 22(4), 463–468 (1975)
Jenkyns, T.A.: The efficacy of the “greedy” algorithm. In: Proc. 7th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 341–350 (1976)
Kakimura, N., Makino, K.: Robust Independence Systems. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 367–378. Springer, Heidelberg (2011)
Kakimura, N., Makino, K., Seimi, K.: Computing Knapsack Solutions with Cardinality Robustness, Mathematical Engineering Technical Reports METR 2011-31, University of Tokyo (2011)
Kellerer, H., Pferschy, U.: A new fully polynomial approximation scheme for the knapsack problem. J. Comb. Optim. 3, 59–71 (1999)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
Korte, B., Hausmann, D.: An analysis of the greedy heuristic for independence systems. Ann. Discrete Math. 2, 65–74 (1978)
Lawler, E.G.: Fast approximation algorithms for knapsack problems. Math. Oper. Res. 4, 339–356 (1979)
Lin, G., Nagarajan, C., Rajarama, R., Williamson, D.: A general approach for incremental approximation and hierarchical clustering. SIAM J. Comput. 39, 3633–3669 (2010)
Magazine, M.J., Oguz, O.: A fully polynomial approximation algorithm for the 0 − 1 knapsack problem. European J. Oper. Res. 8, 270–273 (1981)
Mettu, R.R., Plaxton, C.G.: The online median problem. SIAM J. Comput. 32, 816–832 (2003)
Pisinger, D., Toth, P.: Handbook of Combinatorial Optimization, pp. 1–89. Kluwer, Norwell (1998)
Rado, R.: Note on independence relations. Proc. Lond. Math. Soc. 7, 300–320 (1957)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kakimura, N., Makino, K., Seimi, K. (2011). Computing Knapsack Solutions with Cardinality Robustness. In: Asano, T., Nakano, Si., Okamoto, Y., Watanabe, O. (eds) Algorithms and Computation. ISAAC 2011. Lecture Notes in Computer Science, vol 7074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25591-5_71
Download citation
DOI: https://doi.org/10.1007/978-3-642-25591-5_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25590-8
Online ISBN: 978-3-642-25591-5
eBook Packages: Computer ScienceComputer Science (R0)