✦ LIBER ✦

Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem

✍ Scribed by Hans Kellerer; Ulrich Pferschy

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A dynamic programming method with lists

✍ V. Boyer; D. El Baz; M. Elkihel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 190 KB

A depth‐first dynamic programming proced

✍ Dong X. Shaw; Geon Cho; Hsuliang Chang 📂 Article 📅 1997 🏛 Springer US 🌐 English ⚖ 243 KB

An improved dynamic programming algorith

✍ Jose A. Ventura; Michael X. Weng 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB

An approximate dynamic programming appro

✍ Clara Novoa; Robert Storer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 223 KB

An improved algorithm for the dynamic lo

✍ Kavindra Malik; Yufei Wang 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views

An improving dynamic programming algorit

✍ Nora Touati Moungla; Lucas Létocart; Anass Nagih 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 291 KB