✦ LIBER ✦

Parameterized Approximation Scheme for the Multiple Knapsack Problem

✍ Scribed by Jansen, Klaus

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Polynomial Time Approximation Scheme f

✍ Chekuri, Chandra; Khanna, Sanjeev 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB

Approximation for knapsack problems with

✍ Li’ang Zhang; Yin Zhang 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 477 KB

A successive approximation algorithm for

✍ Zhenbo Wang; Wenxun Xing 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 420 KB

A New Fully Polynomial Time Approximatio

✍ Hans Kellerer; Ulrich Pferschy 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 76 KB

Parallel approximation schemes for Subse

✍ Joseph G. Peters; Larry Rudolph 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 890 KB

Approximation Algorithms for the Multipl

✍ M. Dawande; J. Kalagnanam; P. Keskinocak; F.S. Salman; R. Ravi 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 152 KB