✦ LIBER ✦

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

✍ Scribed by Silvano Martello; Paolo Toth

Book ID: 107989665
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 744 KB
Volume: 22
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(85)90115-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel approximation schemes for Subse

Parallel approximation schemes for Subset Sum and Knapsack problems

✍ Joseph G. Peters; Larry Rudolph 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 890 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

Worst-case analysis of an approximation

Worst-case analysis of an approximation scheme for the subset-sum problem

✍ Matteo Fischetti 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 150 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

A Fast Approximation Algorithm for the S

A Fast Approximation Algorithm for the Subset-sum Problem

✍ Bartosz Przydatek 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

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