✦ LIBER ✦

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

✍ Scribed by Chekuri, Chandra; Khanna, Sanjeev

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Fully Polynomial Time Approximatio

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

Parameterized Approximation Scheme for t

✍ Jansen, Klaus 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 305 KB

A Deterministic Polynomial-Time Approxim

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

A polynomial time approximation scheme f

✍ Jianping Li, Weidong Li, Lusheng Wang 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 433 KB

A Polynomial Time Approximation Scheme f

✍ Xiuzhen Cheng; Joon-Mo Kim; Bing Lu 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 127 KB

A polynomial time approximation scheme f

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views