Fast algorithms for knapsack via convolution and prediction-Reference-Cited by-同舟云学术

Fast algorithms for knapsack via convolution and prediction

Published:2018-06-20 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Bateni MohammadHossein¹,Hajiaghayi MohammadTaghi²,Seddighin Saeed²,Stein Cliff³

Affiliation:

1. Google, USA

2. University of Maryland, USA

3. Columbia University, USA

Funder

National Science Foundation

Defense Sciences Office, DARPA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3188745.3188876

Reference31 articles.

1. Arturs Backurs Piotr Indyk and Ludwig Schmidt. 2017. Better Approximations for Tree Sparsity in Nearly-linear Time. In SODA. 2215–2229. Arturs Backurs Piotr Indyk and Ludwig Schmidt. 2017. Better Approximations for Tree Sparsity in Nearly-linear Time. In SODA. 2215–2229.

2. Richard Bellman. 1957. Richard Bellman. 1957.

3. David Bremner Timothy M. Chan Erik D. Demaine Jeff Erickson Ferran Hurtado John Iacono Stefan Langerman Mihai Patrascu and Perouz Taslakian. 2006. David Bremner Timothy M. Chan Erik D. Demaine Jeff Erickson Ferran Hurtado John Iacono Stefan Langerman Mihai Patrascu and Perouz Taslakian. 2006.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients;Mathematics;2024-06-16

2. 0-1 Knapsack in Nearly Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Knapsack with Small Items in Near-Quadratic Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems;Optimization Letters;2023-05-27

5. Improved Algorithms for Monotone Moldable Job Scheduling Using Compression and Convolution;Euro-Par 2023: Parallel Processing;2023