✦ LIBER ✦

A New Fully Polynomial Time Approximation Scheme for the Knapsack Problem

✍ Scribed by Hans Kellerer; Ulrich Pferschy

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

A fully polynomial approximation algorit

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A Deterministic Polynomial-Time Approxim

✍ Štefankovič, Daniel; Vempala, Santosh; Vigoda, Eric 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 183 KB

The Fully Polynomial Approximation Algor

✍ Liu 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 65 KB

A fully polynomial approximation scheme

✍ E.L. Lawler 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 169 KB

A Randomized Fully Polynomial Time Appro

✍ Karger, David R. 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 403 KB