𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation scheme for a problem of search for a vector subset

✍ Scribed by Shenmaier, V. V.

Book ID
118726214
Publisher
Pleiades Publishing
Year
2012
Tongue
English
Weight
470 KB
Volume
6
Category
Article
ISSN
1990-4789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient fully polynomial approximat
An efficient fully polynomial approximation scheme for the Subset-Sum Problem
✍ Hans Kellerer; Renata Mansini; Ulrich Pferschy; Maria Grazia Speranza πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 238 KB

Given a set of n positive integers and a knapsack of capacity c; the Subset-Sum Problem is to find a subset the sum of which is closest to c without exceeding the value c: In this paper we present a fully polynomial approximation scheme which solves the Subset-Sum Problem with accuracy e in time OΓ°m