A Faster FPTAS for Knapsack Problem With Cardinality Constraint.
http://arxiv.org/abs/1902.00919
@article{DBLP:journals/corr/abs-1902-00919,
author = {Wenxin Li and
Joohyun Lee and
Ness B. Shroff},
title = {A Faster {FPTAS} for Knapsack Problem With Cardinality Constraint},
journal = {CoRR},
volume = {abs/1902.00919},
year = {2019},
url = {http://arxiv.org/abs/1902.00919},
archivePrefix = {arXiv},
eprint = {1902.00919},
timestamp = {Tue, 21 May 2019 18:03:38 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1902-00919.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签