Abstract
A parametric family of approximation algorithms for solving the subset-sum problem is studied. Exact values and bounds for the worst-case performance ratio are obtained.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T.-C. Lai (1993) Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems, Oper. Res. Lett. 14, No. 4, 215–220.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Shamardin, Y.V. (1996). Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem. In: Korshunov, A.D. (eds) Discrete Analysis and Operations Research. Mathematics and Its Applications, vol 355. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-1606-7_19
Download citation
DOI: https://doi.org/10.1007/978-94-009-1606-7_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7217-5
Online ISBN: 978-94-009-1606-7
eBook Packages: Springer Book Archive