Skip to main content

Worst-Case Analysis of Some Algorithms for Solving the Subset-Sum Problem

  • Chapter
Discrete Analysis and Operations Research

Part of the book series: Mathematics and Its Applications ((MAIA,volume 355))

  • 301 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics