✦ LIBER ✦

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

✍ Scribed by Ibarra, Oscar H.; Kim, Chul E.

Book ID: 115439631
Publisher: Association for Computing Machinery
Year: 1975
Tongue: English
Weight: 377 KB
Volume: 22
Category: Article
ISSN: 0004-5411
DOI: 10.1145/321906.321909

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

Worst-case analysis of greedy algorithms

Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems

✍ Tsung-Chyan Lai 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 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

Fast and Scalable Parallel Algorithms fo

Fast and Scalable Parallel Algorithms for Knapsack-like Problems

✍ Afonso Ferreira; John Michael Robson 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 403 KB

We present two new algorithms for searching in sorted X ؉ Y ؉ R ؉ S, one based on heaps and the other on sampling. Each of the algorithms runs in time O(n 2 log n) (n being the size of the sorted arrays X, Y, R, and S). Hence in each case, by constructing arrays of size n ‫؍‬ O(2 s/4 ), we obtain a

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