A Faster FPTAS for Knapsack Problem with Cardinality Constraint

Wenxin Li 0004, Joohyun Lee, Ness B. Shroff. A Faster FPTAS for Knapsack Problem with Cardinality Constraint. In Christos Kaklamanis, Asaf Levin, editors, Approximation and Online Algorithms - 18th International Workshop, WAOA 2020, Virtual Event, September 9-10, 2020, Revised Selected Papers. Volume 12806 of Lecture Notes in Computer Science, pages 16-29, Springer, 2020. [doi]

Abstract

Abstract is missing.