An efficient approximation scheme for the subset-sum problem-Reference-Cited by-同舟云学术

An efficient approximation scheme for the subset-sum problem

Published:1997 Issue: Volume: Page:394-403
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Kellerer Hans,Pferschy Ulrich,Speranza Maria Grazia

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63890-3_42

Reference5 articles.

1. G. V. Gens and E. V. Levner. Approximation algorithms for certain universal problems in scheduling theory. Soviet J. of Comp. System Sci., 6:31–36, 1978.

2. Lecture Notes in Control and Information Sciences;G.V. Gens,1980

3. O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM, 22:463–468, 1975.

4. H. Kellerer, R. Mansini, U. Pferschy, and M.G. Speranza. An efficient fully polynomial approximation scheme for the subset-sum problem. Technical report, University of Graz, Department of Business, 1997.

5. E. Lawler. Fast approximation algorithms for knapsack problems. Math. Oper. Res., 4:339–356, 1979.

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

1. Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents;Journal of Combinatorial Optimization;2024-07-30

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

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

4. Approximation algorithms for knapsack problems with cardinality constraints;European Journal of Operational Research;2000-06

5. On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model;Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics;2000