An efficient fully polynomial approximation scheme for the Subset-Sum Problem-Reference-Cited by-同舟云学术

An efficient fully polynomial approximation scheme for the Subset-Sum Problem

Author:

Kellerer Hans,Mansini Renata,Pferschy Ulrich,Speranza Maria Grazia

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference19 articles.

1. Dynamic Programming;Bellman,1957

2. Hard knapsack problems;Chvatal;Oper. Res.,1980

3. D. Dor, U. Zwick, Selecting the median, in: Proceedings of the Sixth ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 28–35.

4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

5. Approximation algorithms for certain universal problems in scheduling theory;Gens;Soviet J. Comput. System Sci.,1978

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

1. Approximating Partition in Near-Linear Time;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

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