✦ LIBER ✦

A Fast Approximation Algorithm for the Subset-sum Problem

✍ Scribed by Bartosz Przydatek

Book ID: 108572781
Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 746 KB
Volume: 9
Category: Article
ISSN: 0969-6016
DOI: 10.1111/1475-3995.00366

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Approximation Algorithms for t

Efficient Approximation Algorithms for the Subset-Sums Equality Problem

✍ Cristina Bazgan; Miklos Santha; Zsolt Tuza 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB

A polynomial approximation scheme for th

A polynomial approximation scheme for the subset sum problem

✍ Nei Yoshihiro Soma; Alan Solon Ivor Zinober; Horacio Hideki Yanasse; Peter John 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 462 KB

Priority algorithms for the subset-sum p

Priority algorithms for the subset-sum problem

✍ Yuli Ye; Allan Borodin 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 732 KB

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

Approximation schemes for the subset-sum

Approximation schemes for the subset-sum problem: Survey and experimental analysis

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Fast parallel algorithms for the maximum

Fast parallel algorithms for the maximum sum problem

✍ Zhaofang Wen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 414 KB