Linear Time Algorithms for Knapsack Problems with Bounded Weights-Reference-Cited by-同舟云学术

Linear Time Algorithms for Knapsack Problems with Bounded Weights

Published:1999-10 Issue:1 Volume:33 Page:1-14
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Pisinger David

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference17 articles.

1. A. Andersson, Faster deterministic sorting and searching in linear space, inProceedings of the 37th Symposium on foundations of computer science (FOCS'96), pp. 135–141.

2. Dynamic Programming;Bellman,1957

3. An algorithm for large zero–one knapsack problems;Balas;Oper. Res.,1980

4. Hard knapsack problems;Chvátal;Oper. Res.,1980

5. Introduction to Algorithms;Cormen,1989

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

1. Online Non-preemptive Multi-Resource Scheduling for Weighted Completion Time on Multiple Machines;Proceedings of the 53rd International Conference on Parallel Processing;2024-08-12

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. Upward planarity testing of biconnected outerplanar DAGs solves partition;Theoretical Computer Science;2024-06

5. Lower time bounds for parallel solving of the subset sum problem by a dynamic programming algorithm;Concurrency and Computation: Practice and Experience;2024-05-08