Computing Knapsack Solutions with Cardinality Robustness

Naonori Kakimura, Kazuhisa Makino, Kento Seimi. Computing Knapsack Solutions with Cardinality Robustness. In Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, Osamu Watanabe, editors, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings. Volume 7074 of Lecture Notes in Computer Science, pages 693-702, Springer, 2011. [doi]

@inproceedings{KakimuraMS11,
  title = {Computing Knapsack Solutions with Cardinality Robustness},
  author = {Naonori Kakimura and Kazuhisa Makino and Kento Seimi},
  year = {2011},
  doi = {10.1007/978-3-642-25591-5_71},
  url = {http://dx.doi.org/10.1007/978-3-642-25591-5_71},
  researchr = {https://researchr.org/publication/KakimuraMS11},
  cites = {0},
  citedby = {0},
  pages = {693-702},
  booktitle = {Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
  editor = {Takao Asano and Shin-Ichi Nakano and Yoshio Okamoto and Osamu Watanabe},
  volume = {7074},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-25590-8},
}